Let a0, a1, a2, . . . be the sequence defined recursively asa0 = 1, a1 = 2, ak = ak−1 + ak−2 for each integer k ≥ 2.
Use strong mathematical induction to prove that an ≤ 2nfor each integer n ≥ 0.
This is what i have so far with my working.Let P(n) be the statement that an≤2n
Basic step: Prove...