The Recursive Definition of a Fibonacci Number Is Fn) =

question 6

Multiple Choice

The recursive definition of a Fibonacci Number is Fn) = Fn-1) + Fn-2) , where F0) =1 and F1) =1. What is the value of Fib5) ?

• A) 8
• B) 5
• C) 2
• D) 1