Use Mathematical Induction to prove 1. and for n 2 2, The Fibonacci numbers are defined as follows: fo = 0, fı = 1, and for n > 2, fn = fn-1+ fn-2. Prove that for every positive integer n, f3 + fo +...

Use Mathematical Induction to prove

Extracted text: 1. and for n 2 2, The Fibonacci numbers are defined as follows: fo = 0, fı = 1, and for n > 2, fn = fn-1+ fn-2. Prove that for every positive integer n, f3 + fo + ..+ f3n =(f3n+2 – 1) – 1)