Note: This is in C++ I am not sure how to implement the number of swaps and comparisons correctly into my sorting functions. I am using Insertion and Merge Sort by the way

133.029 and the same algorithm on different datasets. First choose a sorting algorithm from the following list (selection sort, insertion sort, bubble sort) and another algorithm from the following list (merge sort, quick sort). Case 1: Randomly generate [1,000, 10,000, and 100.000] integer values (in the range of 0 to 10*) to be inserted into the data structures. Note thdt the list (i.e., the input values) itself should not be sorted and all algoithms should use the same input file when the input size is the same. Case 2: Also, test the speed of algorithms when the input array is already sorted (for the same input data). The following output should be provided for an average of 10 sorts of each algorithm and input size: . the CPU time (use the same machine) . the number of comparisons . the number of swaps Note: You can only use (i.e., copy) code from the book and slides. You need to develop the rest of the code yourself. You can run 2 instances of algorithms that take more than one hour