Code the QuickSort algorithm in which the pivot is always chosen as the first element in the input sequence; then its randomized version R and QuickSort in which each time the pivot is chosen randomly among the input numbers. You need to output (1) the resulting sorted sequence (in oneline), and (2) how many comparisons between the input elements you made, in each algorithm.
Test your algorithms on the input sequence of 10,000 numbers in which the first element is10,000, and the rest are from 1 to 9,999 in increasing order