how to do this

Problem 5.22. The Fibonacci numbers F(n) are described in Section 5.2.2. Indicate exactly which sentence(s) in the following bogus proof contain logical errors? Explain. False Claim. Every Fibonacci number is even. "mes" 2018/6/6 13:43 Page 167 #175 5.3. Strong Induction vs. Induction vs. Well Ordering 167 Bogus proof. Let all the variables n,m,k mentioned below be nonnegative integer valued. Let Even(n) mean that F(n) is even. The proof is by strong induction with induction hypothesis Even(n). base case: F(0) = 0 is an even number, so Even(0) is true. inductive step: We assume may assume the strong induction hypothesis Even(k) for 0