9. Use math induction to prove that if f(1)=2 and f(n)=f(n/2)+3 for n2 such that n=2k then f(n)=2+3log2n. Basic case: n=1 Inductive hypothesis: n=2k Inductive step: n=2k+1