In Java

Insertion Sort Implement the insertion sort algorithm described in class Test your code by generating arrays of random numbers of increasing size (you can do this easily with a loop) and verify that running time is O(n2) Test your code by creating arrays of sorted values (1, 2, .., n for example) and verify that the algorithm runs in O(n)

merge-sort Implement the merge-sort algorithm described in class. Test your code by using arrays of randomly generated values.