(Choose 1 answer)
(See picture)
A. 9
B. 22
C. None of the other choices is correct
D. 27
Ε. 25
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.
wi
43
