Modify the quick sort algorithm so it is generic AND will sort the array in reverse. Also add a local variable count (make sure to use the type long) that will count the number of elements comparisons that were performed for this sorting. Display the value of count before exiting this method. The method should have the following header: static void GenericReverseQuickSort(T[] arr) where T : IComparable

Provided Quick Sort algorithm:

static void QuickSort(T[] arr) where T : IComparable { QuickSortHelper(arr, 0, arr.Length - 1); }

static void QuickSortHelper(T[] arr, int startIdx, int endIdx) where T : IComparable { if(startIdx < endIdx) { int q = Partition(arr, startIdx, endIdx); QuickSortHelper(arr, startIdx, q - 1); QuickSortHelper(arr, q + 1, endIdx);

} }

static int Partition(T[] arr, int startIdx, int endIdx) where T : IComparable { T pivot = arr[endIdx]; int i = startIdx - 1;

for(int j = startIdx; j

i++; //swap elem i and last T tmp2 = arr[i]; arr[i] = arr[endIdx]; arr[endIdx] = tmp2;

return i; }