Implement the following sorting algorithms to find the total number of element comparisons for the given input (n). For each case, randomly generate the input items in the range [0-100]. Compare the practical results with the theoretical average time complexity. How much Quicksort is faster than Selection, Bubble, Insertion, and Mergesort? Note that all algorithms should use the same input random values. Plotthe results in agraph where the input size (i.e. n) is in the x-axis and the total number of element comparisons is in the y-axis.

Selection Bubble Insertion Mergesort Quicksort 100 500 1000 1500 2000 3000 4000 5000