Inversions An inversion in an array A[1n] is a pair of indices {i,j) such that i ALi]. The number of inversions in an n-element array is between 0 (if the array is sorted) and if the array is sorted backward). Describe and analyze an algorithm to count the number of inversions in an n-element array in O(n log n) time. [Hint: Modify mergesort