3. (310=30 points) Use the Master Theorem to find the complexity of each of the following
recurrence relations (show all the steps and the values of different terms to apply the theorem): a)
T(n)=T(2n)+n2 b) T(n)=4T(2n)+n2 c) T(n)=3T(3n)+n.
3 31030 points Use the Master Theorem to find the comple.pdf
1. 3. (310=30 points) Use the Master Theorem to find the complexity of each of the following
recurrence relations (show all the steps and the values of different terms to apply the theorem): a)
T(n)=T(2n)+n2 b) T(n)=4T(2n)+n2 c) T(n)=3T(3n)+n