7. Given the following function: F(n) { if n=1 or n = 2 return 1 Else Return F(n 1) + F(n 2) Prove by induction that for every integer n > 0 n Fm) s {1+ VH) The following fact might help writing the proof. The solutions (roots) to the quadratic equation 0 = ax2 + bx + c (where a, b, c are constants) are given by -b + V62 4ac X1,2 =