need help with this

Time and compare the algorithms (from the HSR text) for insertion sort, merge sort and quicksort Measure average time by generating n random data values and calling the three sorts for the same data Vary n and graph the times Tin) as a function of n To obtain the elapsed tme call a timing function within your program, that starts the timer just before and stops it just after the section to be timed Be .To obtain accurate timings Tin). run the program (for a particular n) with the same data in a loop, and divide the total time for the loop by the number of . To check your program sorts correctly, also output the sequence of points to be sorted as well as te sorted sequence (with each sort) for n . 10 only for each sort. The range of n should be determined so that it allows to compare the performance of the algorithms sure that there is no l/O in the tirned section iterations 0e, take the average time per iteration) this will give you one data point as the time T(n) in your graph of log file or screenshots to show these On inux or mac use "script to generate a typescript file showing your compilation and execution with output of the program. Otherwise add another type Subit your program, input and output for small (n-10) runs, and report describing methods used (including random number generator, data range used timing function and its precision). The program should be well-commented and have a description of input and output parameters for each sorting function Your report should further contain your plots and a discussion of the results, also comparing your observations to the theoretical time complexity