What is the space complexity of the code that uses merge sort for determining the number of inversions in an array?
b) O(log n)
d) O(n log n)
Explanation: The space complexity required by the code will be O(n). It is the same as the space complexity of the code of standard merge sort.