Define the fibonacci numbers by f 0 0 f 1 1 and then recursively for natural numbers n 2 by f n f n 1 f n 2 a Prove by induction that for n 0 the nth fibonacci number satisfies f n 2n b Asymptotically what does this tell us about the growth of f n with respect to n For the toolbar press ALT F10 PC or ALT FN F10 Mac