Question 16
Complete
Mark 1.00 out of 1.00
Consider an recursive algorithm to compute the nth Fibonacci number:
procedure Fibo(n: positive integer)
if n = 1 return 1
else if n = 2 return 1
else return Fibo(n-1) + Fibo(n-2)
How many additions (+) are used to find Fibo(7) by the recursive algorithm above?
Ο Α. 13
Β. 14
C. 11
D. 12
