Add code to QuickSort and Partition to count the number of comparisons done in sorting a list.

def QuickSort2(L, a, b, totalCount):

''' Arranges the elements of L between indices a and b in nondescending order and returns the total number

of comparisons perfored. '''

...

return totalCount

def Partition2(L, a, b):

''' Rearranges the elements of L between indices a and b so that all elements

smaller than L[a] lie to the left of L[a]'s new index and all

elements larger than or equal to L[a] lie to the right

then retruns L[a]'s' new index and the number of comparisons performed. '''

...