( Do This with only Selection sort and do not copy from chegg) Implement insertion sort, selection sort, bubble sort, merge sort, and quicksort to sort the numbers in the increasing order. Write the...

                  ( Do This with only Selection sort and do not copy from chegg)

Implement insertion sort, selection sort, bubble sort, merge sort, and quicksort to sort the numbers in the increasing order. Write the program to evaluate the performance of your algorithms in two ways: (1) CPU time; (2) total no. of steps.

Input:

• the number of integers to be sorted, n.


• generating three instances as follows:
  
  
  
  1. sorted input data set: 1, 2, 3, … n;
  
  
  2. reversely sorted input data set: n, n-1, …, 3, 2,1;
  
  
  3. random permutation of 1, 2, …, n (random permutation means that each number of 1, 2, …, n appears exactly once in the input data set but with random position. For example, if n=5, then you may have the random permutation 4, 1, 3, 5, 2).
  
  
  
  

Test your program and do the experiments as follows:

Run the above three generated input data sets for each n (number of integers) = 100, 300, 500, 1000, 3000, 5000, 10000, 50000