Solve each recurrence below using the Master Method and write your final answer using O-notation. Make sure that you show al your work including the corresponding case and the values of e or k used. If it is not possible to solve a recurrence using the Master Method, explain why by showing that the form is inapplicable or by showing that all 3 cases cannot be satisfied. (a) T(n) = 49T(n/7)+7 (b) T(n) = 3T(n/5) + n (c) T(n) = 5T(n/5) + 5n (d) T(n) = 4T(n/4) +2n (e) T(n) = T(n) + 3n n (f) T(n) = T(2n/5) + 5 (g) T(n) = 9T(n/3) + n lg n (h) T(n) = T(n/3) +2T(n/5)+n (i) Bonus (+5 points): T(n) = 2T (n) + log n Hint: It is possible using the Master Method but requires a change of terms.Activate Wir Go to Settings t