Consider the following recursive implementation to find the nth fibonnaci number:Which of the following is the base case?

Question

TuteeHUB · Accepted Answer

NA

TuteeHUB · Answer

if(n == 1)

TuteeHUB · Answer

else if(n == 2)

TuteeHUB · Answer

return fibo(n – 1) + fibo(n – 2)

TuteeHUB · Answer

both if(n == 1) and else if(n == 2)

1.	Consider the following recursive implementation to find the nth fibonnaci number: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)
Answer» E.

Discussion