Question 2. (40 POINTS): Implement the InsertionSort and MergeSort algorithms in any programming language of your choice. Then measure the runtime of each algorithm for integer arrays of sizes given in 2A through 2D.

2.A.) (10 POINTS) size n=100 - case 1: for a sorted array of ascending order,

1

- case 2: for a sorted array of descending order, - case 3: for an unsorted (random) array

2.B.) (10 POINTS) size n=1000 - case 1: for a sorted array of ascending order, - case 2: for a sorted array of descending order, - case 3: for an unsorted (random) array

2.C.) (10 POINTS) size n=10000 - case 1: for a sorted array of ascending order, - case 2: for a sorted array of descending order, - case 3: for an unsorted (random) array