Kizspy | Question: 28
(Choose 1 answer)
A. a + (a-1) + ... + 2 + 1 B. a^n C.na
D. None of the other choices is correct.
Given the recursive algorithm procedure fun(a: int; n: positive int)if n=1 then fun(a, n): = a else fun(a, n): = a + fun(a, n-1)What does this algorithm compute?
