fibonacci sequence {fn}= 1,1,2,3,5,8,13,... you know this. defined recursively byf1=1f2=1fn+2 =fn+1 +fnforn=1,2,3,... use complete induction to prove thatfn< 2^nfor all positive integersn. I'm just a little confused with the complete induction part the book and teacher didn't explain it too well.