Add to Chrome
✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.
What is the base case in a recursive Fibonacci function?
No base case is needed
When n > 2
n > 2
When n == 1 or n == 0
n == 1
n == 0
When n == 2
n == 2
Get Unlimited Answers To Exam Questions - Install Crowdly Extension Now!