Kizspy | Question: 29
(Choose 1 answer)
(See picture)
A. 22
B. 25
C. 27
D. 9
E. None of the other choices is correct
FUOVERFLOW
Given the recursive algorithm
procedure T(n: integer)if n <3 then return 3 else if (n mod 2 = 0) then return n else return 3*T(n-1)-2
Find ouput ifn = 9.
