Write a c++ code the does the following:

implement the merge sort, the quick sort, bubble sort, and the insertion sort. for simplicity, you just need to consider sorting integers within a fixed size array.

study the effect of the initial array size, the initial ordering of the numbers within the array on the number of comparisons and the exchanges needed for each array.

make sure to run the same array with the same values through all different algorithms for fair comparison.

present your findings in a way that will allow you to draw some conclusion as related to the corner cases that will impact the performance of these different algorithms.

you should submit your c++ source code along with screen shots of sample runs that showed successful runs for the above steps.