ple Choices Given, Document
☑Kizspy.me
(Choose 1 answer)
☐ A
☐ B
ос
☐ D
Find the output of the recursive algorithm if input n = 5.
procedure TT(n: integer);
If n=1 then f(1):=0
else f(n): f(n-1)*n;
A. -120
B. -240
☐ E
I want to ins the exam.
C. 0
D. 120
E. 240
LAPTOP RUNNING
