Let F(n) be the Fibonacci sequence. Prove using induction: = F(i) = F(n + 2) -1 for all n>0. (The sum of the first n Fibonacci numbers is equal to Fin + 2) - 1. Use F(1) - F(2) - 1.)