algorthims please solve e,f,g,h,i and put a and b also put the case and if is not master theoream why

2. Recurrences (Master Method). (24 points) Solve each recurrence below rising 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 cork 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) = 37(n/2)+2 (b) T(n) = 25T(n/5) + (c) T(n) = T(31/10) + a) T(n) = nT() +21 (e) 7(n) = 3T (7/3) + 1/3 (f) Tn) = 9T (w/3) + n IgP. (8) T(n) = ST(n/3) + nigan (1) T(n)= T/3) +2T(n/5) + n (1) Bomus (+5 points): T(n) = 217) + logn