# Can i please get help with problem 3? please, if possible, answer in a text format….

Can

i please get help with problem 3? please, if possible, answer in a

text format.

JN/2) f(n/2); f(n/2); f(n/2); Problem 3. Let A[O…n-1) be an array of n distinct integers. A pair (Ali), A[]) is said to be an inversion if these numbers are out of order, i.e., i AG). Design a O(n log n) time algorithm for counting the number of inversions.