(Choose 1 answer)
Which of the following algorithms are recursive?
procedure ABC(n, P: integers)P:=0;for j:=1 to n begin if (j mod 2 = 0) then P: = P -j;else P: = P + j;
end
(ii) procedure ABC(n, P: integer)P: = 1:for j:=1 to n begin if (j mod 2 = 0) then P: = P+j else P: = P*j end
A. None of them
B. Only (i)
C. Only (ii)
D. Both of them
Exit 9
