The Fibonacci Sequence is defined as:

F$(0)=0,$

F$(1)=1,$

F$($n$)=$F$($n$-1)+$F$($n$-2),$ for non$-$negative integer n $>1.$

You are asked to prove that the n$\text{'}$th fibbonacci number is at least $1\mathrm{.}618^($n$-2)$ for all n in positive integers.

Based on the principles taught in the lecture, which of the following approaches would be insufficient to prove this?

Question $3$Answer

a$.$

Ordinary Induction

b$.$

Well$-$Ordering Principle

c$.$

Strong Induction