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^6) to be inserted into the data structures. Note that the list (i.e., the input values) itself should not be sorted and all algorithms 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