Your goal is to implement the following sorting algorithms and compare their performance using

random list of numbers. Multiple lists of different sizes $[10,100,1000,,100000]$ should be

used. These can be generated using random number generator.

$1.$ MergeSort

$2.$ QuickSort

Basic libraries should be used avoiding any complex data structure.

Tools required:

Any library function to compute duration of running time $($provide brief description in your

reports$).$

Your own built$-$in function $($using following signature$)$ to generate array of random integers $($using

a built$-$in library$).$

int$[]$ random$\_$list$($int length, int seed $=0,$ int start$=0,$ int end$=$ INT$\_$MAX$)$

Plot the chart to show the runtime for each of the sorting algorithm across different values of n