Q444
Consider the following recursive implementation to find the nth fibonnaci number: int fibo(int n) if(n == 1) return 0; else if(n == 2) return 1; return fibo(n - 1) + fibo(n - 2); int main() int n = 5; int ans = fibo(n); printf("%d",ans); return 0; Which of the following is the base case?
A.
if(n == 1)
B.
else if(n == 2)
C.
return fibo(n - 1) + fibo(n - 2)
D.
both if(n == 1) and else if(n == 2)
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board