Consider the Recursive Version of the Fib Method from the Textbook

question 93

Multiple Choice

Consider the recursive version of the fib method from the textbook shown below: public static long fib(int n)
{
If (n <= 2)
{
Return 1;
}
Else
{
Return fib(n - 1) + fib(n - 2) ;
}
}
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) 24
• C) 30
• D) 32

---

Definitions:

Season Tickets

Long-term passes purchased in advance for multiple access to a venue, event series, or mode of transportation.

Interest Expense

The cost incurred by an entity for borrowed funds, reflecting the price of accessing credit.

Note Payable

A written promise to pay a specified amount of money, typically including interest, by a certain date.

Operating Cycle

The amount of time it takes for a company to purchase inventory, sell it, and convert the sales back into cash.