Using 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.

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 Ai Ali] 8 Ali 1]-key MERGE(A, p,q,r) 3 let LI1..ni + 11 and R[1..n, 11 be new arrays fori 1 to ni 6 for j= 1 to n2 10 i=1 12 for k -p to r 13 if Li Rj] Ak] = L[i] 15 16 ele Ak]RU 17