. Exercise 4.12. The Fibonacci numbers are defined recursively by F1 = 1, F2 = 1, and for n ≥ 3, Fn = Fn−1 + Fn−2. Prove that the Fibonacci numbers are given by the equation Fn = (1 + √ 5)n − (1 − √ 5)n 2 n √ 5