Multiple choices 2/50
(Choose 1 answer)
A. 120
B. 0
C. -120
D. 240
E. -240
Next
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;
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27 28
29
30
31
32
33
34
35
36
37
38
39
43
44
45 46 47
48
49 50
40 41 47
