Prove by Induction

Problem 5.26. The Fibonacci numbers Fo, 0, F, F2,... are defined as follows: F2, 0 These numbers satisfy many unexpected identities, such as 2 (5.22) Equation (5.22) can be proved to hold for all n e N by induction, using the equation itself as the induction hypothesis, P (n) (a) Prove the base case (n - 0) (b) Now prove the inductive step