Consider the recurrence T(n) = 2T(n/2) + f(n) in which = f(n) = { s n3 if log(n)] is even n2 otherwise Show that f(n) = N(nlog, (a)+C). Explain why the third case of the Master's theo- rem does not apply. Prove a -bound for the recurrence. =