3. Let (p is known as the Golden Ratio, and figures prominently in the visual arts. and p are the two roots of the quadratic equation 2 1 0.) The Fibonacci sequence Fo, F1, F2, . of natural numbers is defined recursively as follows: Fo=0, and for all integers n 2 2, The Fibonacci numbers are intimately related to p and . Prove via induction that, for all natural numbers n including zero) 3. Let (p is known as the Golden Ratio, and figures prominently in the visual arts. and p are the two roots of the quadratic equation 2 1 0.) The Fibonacci sequence Fo, F1, F2, . of natural numbers is defined recursively as follows: Fo=0, and for all integers n 2 2, The Fibonacci numbers are intimately related to p and . Prove via induction that, for all natural numbers n including zero)