Problem #$1(10$ marks$)($You need to program for this problem.$)$

The textbook $($as well as the instructor$)$ has told you about the order of the sorting algorithms

$($Selection$,$ Insertion, Bubble, Quick, and Merge$).$ The question is: Do you actually agree with the

theoretical representation of the results presented to you? How would you go about proving or

disproving what you have been told about the order of algorithms in relation to reality?

Create an unsorted array list with $100$ random items in it and then sort it$.$ Count the number of

comparisons required to sort it$.$ Do this for bubble sort and quick sort and do each algorithm $10$ times,

and plot the results on a graph showing how many comparisons are required for each of the sorting

algorithms and finally, you can answer the original question $"$do the practical results match the

theoretical results?" Note that be specific in your answer and support your conclusion with the data

results you have obtained.

provide a very simple code in Java eclipse which is easier to understand.