1. Master Theorem. Use the master theorem to solve the following recurrences. Justify your results (i.e. state what case
Posted: Sat Feb 19, 2022 3:23 pm
1. Master Theorem. Use the master theorem to solve the following recurrences. Justify your results (i.e. state what case you use and why you use this case). Assume T (1) = 1. (a) T(n) = 2T(n/2) + n2 (b) T(n)=64T(n/4)+sqrt(n). c) T(n)=9T(n/3)+nºlogn. (d) T(n)=32T(n/2)+n²logn.