C-8.9 Let S be an array of n elements on which a total order relation is defined. An inversion in S is a pair of indices i and j such that i S j Describe an algorithm running in O(n log n) time for determining the number of inversions in S (which can be as large as O(n2)). Hint: Try to modify the merge-sort algorithm to solve this