Question: 72
(Choose 1 answer)
Given the recursive algorithm
(See picture)
A. 22
B. 25
C. 27
D. 9
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
E. None of the other choices is correct
Find ouput ifn = 9.
