The number of inversions is an array is the number of $(i,j)$ pairs $($where i and $j$ are index positions and each pair is considered only once$)$ such that $A[i]>A[j]$ and $(1,2)A[1]>A[2]1,3A[1]>A[3]2,3A[2]>A[3]1,4A[1]>A[4](4)A[2]>A[4]$