Please solve this problem in java. Also attach screen shots of output.

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=64,$ dots,$2^{20}.$ 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. Note: the array A needs to be converted into a queue before it's input to the Merge$-$sort algorithm.