1. Compare the time complexities of merge sort and insertion sort. 2. Use the informal definitions of o, e, and to determine whether the fol- lowing assertions are true or false. a. n(n+1)/2 2(n) b. n(n+1)/2 0(na) C. n(n+1)/2 (n) d. n(n+1)/2 + 2(n) 3. Sort the following array by showing the result of each iteration using the INSERTION sort algorithm (provided in lecture slides). 4 8 6 Array = 3 5 7 Iteration j-2 - 4 j-5 -6 4. Order the following functions according to their order of growth (from the lowest to the highest): (n-2)!, 5 lg(n +100)0, 221, 0.001n +3n +1, Inn, Vn, 3