Consider the recursive version of the fib method from the textbook shown below: How many total recursive calls (not counting the original call) to fib will be made from the original call of fib(7)?
A)12
B)32
C)24
D)30

Question

Consider the recursive version of the fib method from the textbook shown below:  How many total recursive calls (not counting the original call) to fib will be made from the original call of fib(7)? 
A)12 
B)32 
C)24 
D)30

Quizplus · Accepted Answer

Starting with the original call of fib(7), recursive calls will be made as follows:
- One call to fib(6)
- Two calls to fib(5)
- Three calls to fib(4)
- Five calls to fib(3)
- Eight calls to fib(2)
- Five calls to fib(3)
- Three calls to fib(4)
- Two calls to fib(5)
- One call to fib(6)
This adds up to a total of 24 recursive calls.

Consider the Recursive Version of the Fib Method from the Textbook