ANSWER IN JAVA 1. Write a program that generates an array A of n random integers, and sorts A using Insertion-Sort, Quicksort and Merge-sort. Run your program with arrays of size n = 8, 16, 32, 64, , 220. Keep track of the CPU time each algorithm takes to sort each of these arrays. Comment on the running times you obtained, and compare them to the complexities as discussed in class. Hint: place the CPU times you obtained on a table or a plot (or both) to interpret the results.

2.Implement the recursive algorithm that reverses an array, and run it on the sorted lists of Insert