Question 12 Let A[1..n] be an array of n distinct numbers. If i A[j] then the pair (i, j) is called an inversion of A. Give an algorithm that determines the number of inversions in any permutation on n elements in O(n log n) worst-case time. (Hint. Modify merge sort.) What, if anything, needs to be changed if A may contain duplicates