In C++ sort an array of 10,000 elements using the quick sortalgorithm as follows: a. Sort the array using pivot as the middleelement of the array. b. Sort the array using pivot as the medianof the first, last, and middle elements of the array. c. Sort thearray using pivot as the middle element of the array. However, whenthe size of any sublist reduces to less than 20, sort the sublistusing an insertion sort. d. Sort the array using pivot as themedian of the first, last, and middle elements of the array. Whenthe size of any sublist reduces to less than
OR
OR