How do you count inversions in an array efficiently?

Question Explain

This problem asks to count pairs (i, j) such that i < j and arr[i] > arr[j]. It tests Merge Sort adaptation.