2
(Choose 1 answer)
Given the recursive algorithm
Procedure function (n: positive integer)if (n=1) then function(n):= 1 else if (n = 2) then function(n): = 1 else function(n): = function(n-1) + function(n-2)
Find the value of function(n) when n = 7.
A. 5
B. 3
C. 13
D. 1
