To analyze divide-and-conquer recursive algorithms using linear, homogeneous recurrence relations with constant coefficients.
Show all work. i.e., justify your answers.
Exercises in the Recurrence Relations notes, Part I (Section 1.2) . [Three questions: 1 point each for the parts of question 1, 3 points each for questions 2 and 3]