Consider the Recursive Version of the Fib Method from the Textbook

question 24

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(6) ?

• A) 6
• B) 12
• C) 14
• D) 20

---

Definitions:

Deposits in Transit

Funds that have been received and recorded by a company but not yet by its bank.

Bank Reconciliation

Process of verifying the accuracy of both the bank statement and the cash accounts of a business.

Bad Debt Expense

This refers to an expense recognized by businesses to account for invoices that are unlikely to be paid by customers.

Income from Operations

The earnings generated from a company's principal business activities, excluding non-operating income and expenses such as interest and taxes.