O(nlogn) Array Sequel

Let $A$ be an array of $n$ distinct numbers. If $i \lt j$ and $A[i] \lt A[j]$, then the pair $(i, j)$ is called an inversion of $A$. Given an array $A$, your task is to determine the number of inversions of $A$ in $O(n*log_2 n)$ time. ###Input: - The first line consists of an integer $T$ denoting the number of test cases. The description of $ T$ test cases follows. - The first line of eac