How do you solve this using the Master Method? I only got this far. Give tight bounds for the following recurrence relations. Show a, b, and f(n). Then explain whether it fits one of the cases, and if so why while choosing , c, and n0 where necessary. Write and simplify the final result. :

T(n) =7T(n/3) + n

a = 7; b = 3; f(n) = n If you could explain the steps, that would be greatly appreciated. I think it's Case 1, but I'm not sure how to explain that part, like how do we get to that?