(python)How to find the total number of comparisons and the total number of swaps in quick sort and merge sort?

I need to add code that counts the total number of comparisons and the total number of swaps in quick sort and merge sort, but I'm not sure how to do it...

Here's my code for quick sort and merge sort:

def mergeSort(alist): if len(alist)>1: mid = len(alist)//2 lefthalf = alist[:mid] righthalf = alist[mid:] mergeSort(lefthalf) mergeSort(righthalf) i = 0 j = 0 k = 0 while i < len(lefthalf) and j < len(righthalf): if lefthalf[i] < righthalf[j]: alist[k] = lefthalf[i] i += 1 else: alist[k] = righthalf[j] j += 1 k += 1 while i < len(lefthalf): alist[k] = lefthalf[i] i += 1 k += 1 while j < len(righthalf): alist[k]=righthalf[j] j += 1 k += 1 def quickSort(alist): quickSortHelper(alist,0,len(alist)-1) def quickSortHelper(alist,first,last): if firstdef partition(alist,first,last): pivotvalue = alist[first] leftmark = first+1 rightmark = last done = False  while not done: while leftmark <= rightmark and alist[leftmark] <= pivotvalue: leftmark = leftmark + 1 while alist[rightmark] >= pivotvalue and rightmark >= leftmark: rightmark = rightmark -1 if rightmark < leftmark: done = True  else: temp = alist[leftmark] alist[leftmark] = alist[rightmark] alist[rightmark] = temp temp = alist[first] alist[first] = alist[rightmark] alist[rightmark] = temp return rightmark 

Can anyone help me with adding code that counts the total number of comparisons and the total number of swaps? Thank you so much!