☑Kizspy.me
Answer (Choose 1 answer)
Find ouput of the recursive algorithm when n = 4.
procedure f (n: positive integer)
if n = 1 then
☐ A
(See picture)
A. 79
B. 83
return 1
☐ D
C. 10
else
☐ E
return 3*f(n-1)+4
D. None of the other choices
is correct
E. 14
Back
Next
FUO.sh
sh the exam.
