2) (8 points, 4 points each): We used Recursion Trees (CLRS Section 4.4) to figure out the runtime for MergeSort (Slide 13 of Lecture 5), to figure out runtime for two multiplication algorithms (Slides 20 and 25 of Lecture 12) and to explain the Simplified Master Theorem (Slide 33 of Lecture 12) a) (4 points): Use a Recursion Tree to determine a good asymptotic upper bound on the recurrence equation: T(n) = 3T( Ln21 ) + n You must use a Recursion Tree in your answer. Be sure to show your work; don't just provide the answer Helpful hint: You can ignore the floor function, and just solve this for T(n) - 3T(n/2) + n b) (4 points): Use the Substitution Method to show that your result is correct. The same helpful hint can be used again