Add to Chrome
✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.
The time complexity of computing Fibonacci recursively is:
O(n)
O(log n)
O(2ⁿ)
O(n²)
Get Unlimited Answers To Exam Questions - Install Crowdly Extension Now!