Write a complete C++ program to compare selection, insertion, quick, heap and merge sorts algorithms in functions and results,pls ensure to meet these requirments:

1.Add the time elapsed function

2.Randomly generate N={100, 1,000, 10,000, 100, 000, 1,000,000}

3.Run your selection, insertion, quick, heap and merge sorts algorithms and printout the time elapsed for each N.

4.A snap shot of at least an output for each algorithm is expected.

5.Make a log-log plot for each sorting algorithm using the run-time for the set of N-values

6.Compare your result with the summary and present your thoughts and observations