Q4_152_20250805105336.webp

☑Kizspy.me
(Choose 1 answer)
☐ A
☐ E
Find the output of the recursive algorithm if input n = 5.
procedure TT(n: integer);
If n=1 then f(1)=-2
else f(n):=f(n-1)*n;
A. -120
B. -240
C. 0
D. 120
E. 240
FUO.sh
sh the exam.