2. Consider the recurrence T(n)-2T(n/2) f(n) in which f(n)-I3 if log(n)] is even n2 otherwise (a) Prove that T(n) O(n3) by induction. (b) Show that f(n) - S2(nlo%.(a)+*) for some e0 and use master theo- nlogb(a).te) for some 0 and use mas ter t- rem to solve this recurrence