In this part, you need to

Implement insertion sort, bubble sort and merge sort learned in L$2$ and L$3$;

Generate different size of random data;

Test each algorithm on the synthetic data and record the running time;

Visualize the running time by plotting figure$($s$)$ where y$-$axis is time and x$-$axis is data size;

Write down a brief report to describe your implementation details and show the figures.

Note that, for big data $($e$.$g$.,$ N$>10$K$),$ insertion sort and bubble sort may be very slow. In such cases, you can simply ignore and do not need to wait the algorithm terminated.