***************** CODE IN C++*****************

Implement two sorting algorithm (insertion and merge sort) learned in the class with several inputs from different size.

Compare the running time from implementations and write a report of your findings.

Start with small size input like 10 integer array and increase your input size until your computer can handle or meaningful results occurs.

Use exact algorithm from text book for sorting programming and you can use system clock to measure running time.

*************** THESE ARE THE TEXTBOOK ALGORITHMS THAT HAVE TO BE USED******************

INSERTION-SORT(A) 1 for j= 2 to A. length costtimes key = A[j] 3I Insert Alj] into the sorted sequence A [1 j-1]. 0 5 whilei 0 and A[i] > key 8 A[i + 1] = key