chegg Desc 3. Let A = A[1],..., A[n] be an array of n distinct positive integers (the value of these integers could be very very large). An inversion is a pair of indices i and j such that i A[j]. For example in the array [30000, 80000, 20000, 40000, 10000], the pair i= 1 and j = 3 is an inversion because A[1] = 30000 is greater than A[3] = 20000. On the other hand, the pair i = 1 and j = 2 is not an inversion because A[1] = 30000 is smaller than A[2] = 80000. In this array there are 7 inversions and 3 non-inversions. Describe an efficient algorithm that counts the number of inversions in any array. What is the running time of your algorithm?