Problem 4. let A[L.nl be an array of n distinct numbers. If, U], then the pair (i,j) is called an inversion. (a) List the five inversions of the array [2,3,8,6,1]. (b) Give a worst-case (nlogn) algorithm that determines the number of inversions in A Explain your algorithm, give an example and derive its running time