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 f(n)${17,15 The following fact might help writing the proof. The solutions (roots) to the quadratic equation 0 = ax + bx+c (where a, b, c are constants) are given by - b b - 4ac (1,2 = 2