algorthams solve e, f , g , h , i with clear hand write

2. Recurrences (Master Method). (24 points) Solve each recurrence below using the Master Method and write your answer using e-notation. Make sure that you show all 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, prove it by showing that the form is inapplicable or by showing that all 3 cases cannot be satisfied. (a) T(n) = 3T (n/2) + na (b) T(n) = 25T(n/5)+n (c) T(n) = T(3/10)+n (d) T(n) = n7(n) + 2n (e) T(n) = 3T (n/3) + 1/3 (f) T(n) = 9T(n/3) + n Ign (g) T(n) = 9T (n/3) + n lgn (1) T(n) = Tn/3) +2T(n/5) + n (i) Bonus (+5 points): T(n) = 2(n) + logn