4. Consider the recurrence T(n) = 2T(n/2) + f(n) in which S n3 if log(n)] is even in? otherwise (a) Prove that T(n) = O(n) by induction. (b) Show that f(n) = 2(log(a)+) for some e > 0 and use master theo- rem to solve this recurrence