The file contains all of the integers between 1 and 10,000 (inclusive, with no repeats) in unsorted order. The integer in the ith row of the file gives you the ith entry of an input array. Your task is to compute the total number of comparisons used to sort the given input file by Quicksort. As you know, the number of comparisons depends on which elements are chosen as pivots, so we'li ask you to explore three different pivoting rules. You should not count comparisons one-by-one. Rather, when there is a recursive call on a subarray of length m, you should simply add m1 to your running total of comparisons. (This is because the pluot element is compared to each of the orher m1 elements in the subarray in this recursive call.) Implement the quick sort algorithm and compute the total number of comparisons for different pivot selection: a- the final element of the array as the pivot element. b- the maximum element of the array as the pivot element. c- the random element of the array as the pivot element. Submit your code as a pdf file and compare your results and explain which of the pivot selection give you the less number of comparisons