Let A[1,2,...n] be an array of n distinct numbers. If i < j and A[i] > A[j], then the pair (i,j) is called a transposition of A. Give an algorithm that determines the number of transpositions in an array consisting of n numbers in (nlogn) worst-case time. Also prove the correctness and run time bounds for your algorithm.