i wanna the code for the extra credit that i circeled, and in c++ program

You need to program the following four sorting algorithms; o Quick Sort o Selection sort o Insertion sort o Bubble sort A data is given as follows; 91, 82, 4, 34, 7, 55, 63, 10, 77, 88, 26, 9, 102, 21, 58 You can use one-dimensional array. You need to print the given data whenever there is a change in the order For Selection Sort and Insertion Sort, print the number of comparisons and the number of exchanges . (Extra point) Randomly generate 40 integers between 1 and 400 and sort them as above. Print your numbers whenever there is a change in the order. For the Selection Sort and Insertion Sort, print the number of comparisons and the number of exchanges