JAVA PLEASE

Implement the insertion sort algorithm.

Implement the merge sort algorithm.

Test the sorting algorithm as follows.

For input sizes n = 500, n = 1,000, n = 1,500, ..., n = 10,000 [That's 20 different values of n]

generate an array Ais of size n.

Fill the array with n random integers.

generate a copy of the array, Ams.

Pass the array Ais to your insertion sort and record the number of comparisons.

Pass the array Ams to your mergesort and record the number of comparisons.

Then produce a graph which shows for each value of n, the number of comparisons for each sort

You should also plot n log n and n2 on the same graph to compare their shape with the insertion sort and mergesort results.