Asap Question 7

3, suppose Ten) . 2 Tw4). is the recurrence for the runningtime of anaig nhmtnwthem.nmne and use it to guess the solution O() to the running time Tn). 4. We proved that Insertion Sort is a () algorithm and Merge Sort is a On lg n) algorithm. That might see to indicate that Merge Sort is a better given an input seque of numbers to sort, list two reasons why Insertion Sort might actually run a lot Joster lie, fewer stees) th Merge Sort 5. Is 2"-1000n-100-Qm)? No 6. Express 0.01n2+10m+1000nlogn+2 in terms of 8-notation. 7. Suppose we know that An)- O(hin)). Now prove that h n)-afin))