Im currently trying to count the number of inversions by implementing merge sort in python but cant figure out how to add the inversions correctly

Question

"""

#Importations
import math

totalInv = 0
#Method to split arrays to base case
def divideSort(arr):
   half = int(len(arr) / 2)
   left = []
   rig