Divide and Conquer Algorithm (MergeSort Algo) calculating number of inversions

Question

I am trying to solve the problem of calculating the number of inversions where the problem is:

`An inversion of a sequence