(JAVA)

We will look at the behavior of three different sorts on randomly generated lists of different sizes. The three sorts are bubblesort, insertion sort, and quicksort Randomly generate integers in the range 0-99 for your random numbers. You may choose your own random number generation technique (this is an exception to the no-outside-help requirement for this assignment. You must document the source of your random number generation in the code. Here is what your code should do: 1. Do this 10 times: a. Generate a random list of 10 items b. Have each algorithm sort the list. c. Give the original list, the sorted list, and the number of comparisons done by each algorithm. 2. Do this 10 times: a. b. c. Generate a random list of 100 items Have each algorithm sort the list. Give the original list, the sorted list, and the number of comparisons done by each algorithm. 3. Do this 10 times: a. b. c. Generate a random list of 1000 items Have each algorithm sort the list. Give the original list, the sorted list, and the number of comparisons done by each algorithm. 4. At the end: For each algorithm and each list length give the average of the number of comparisons. a