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 S1 Describe an algorithm running in O(nlogn) 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