PLEASE help in a little detail the steps you take i want to learn how to do this but am utterly lost. thank you cery much

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 The following fact might help writing the proof. The solutions (roots) to the quadratic equation 0 = ar + bx+c (where a, b, c are constants) are given by =- 6 7b2 - 4ac 2