How Many Recursive Calls to the Fib Method Shown Below

question 20

Multiple Choice

How many recursive calls to the fib method shown below would be made from an original call to fib(4) ? (Do not count the original call)
Public int fib(int n)
{ // assumes n >= 0
If (n <= 1)
{
Return n
}
Else
{
Return (fib(n - 1) + fib(n - 2) ) ;
}
}

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

---

Definitions:

Indefinitely

For an unlimited or unspecified period of time, often used in the context of contracts or agreements.

Rate of Return

The increase or decrease in the value of an investment during a set timeframe, represented as a proportion of the investment's initial expense.

Dividends

Payments made by a corporation to its shareholder members, representing a distribution of the company's profits.

Annually

A term that pertains to an event or item that occurs once every year.