Question: i know the master method does not apply because the non-polynomial difference between f(n) and n^{log _{b}a}}. So i just need the solution using the

i know the master method does not apply because the non-polynomial difference between f(n) and n^{\log _{b}a}}. So i just need the solution using the recursion tree method
2. (15pts) Can the master method apply to the following recurrence? Explain your answer in sufficient details. If your answer is no, solve it using the recursion tree method. No need to use the substitution method to prove it. Assume the base case is T(1) = 1. T(n) = 2T(n/2) + n/Ign
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
