In this project, you will implement three sorting algorithms and perform experiments to evaluate their performance. Three algorithms are:

Selection$/$Insertion Sort $($pick one$)$

Merge Sort

Quick Sort

Performance evaluation

In the code for each algorithm, implement a counter to count the number of operations $($statements$),$ which will be used to compare the algorithms. The input unsorted sequences need to be randomly generated with different input size. The number of operations for each algorithm under different input sizes will be plotted in figures in which x axis is the input size and y axis is the number of operation $($If the input scale from $10,20,..1$ million, use logarithm scale$).$ Draw your conclusion based on the plotted figures. Compare your conclusion with these algorithms' big Oh notation

What to submit

$1.$Source code for the algorithms

$2.$Files used to store the input $($if you use separate file to store input$)$

$3.$ Readme file about how to run your code, arguments, expected outputs and so on$.$

$4.$Detailed report including how the experiments are designed, how the inputs are organized, how the number of operations is counted $($what you count, comparison, exchange or every statement$),$ the performance figure and your conclusion

I just need help with the second half.