let s be an array with n integers. an inversion in s is a pair of elements x and y such that x appears before y in s but x > y. describe an algorithm running in o(n log n) time for determining the number of inversions in s. present pseudocode, and justify both correctness and running time. hint: try to modify the merge-sort algorithm to solve the problem. consider running merge- sort in parallel with your main algorit