Draw the recursion tree for T(n) = T(n/3) + T(n/4) + Θ(n) to make an educated guess at a solution to the recurrence. Use the substitution method to prove your solution is correct. If we assume T(a) < T(b) for all a < b, how could we use the master method to solve this problem? Why can we not use the master method otherwise?

Draw the recursion tree for T(n) = T(n/3) + T(n/4) + Θ(n) to make an educated guess at a solution to the recurrence. Use the substitution method to prove your solution is correct. If we assume T(a) < T(b) for all a < b, how could we use the master method to solve this problem? Why can we not use the master method otherwise?

Image text
Draw the recursion tree for T(n) = T(n/3) + T(n/4) + Θ(n) to make an educated guess at a solution to the recurrence. Use the substitution method to prove your solution is correct. If we assume T(a) < T(b) for all a < b, how could we use the master method to solve this problem? Why can we not use the master method otherwise?

Detailed Answer