. Consider the recursive algorithm

Algorithm B

INPUT: x Z, x > 0

OUTPUT: ??

if x = 1 then return 1; else return x² + B(x 1);

fi;

end;

(a) Trace B(5).

(b) Explain in one sentence what this algorithm does. [6]

Algorithm B INPUT: 2 2,2 > 0 OUTPUT: ?? if x= 1 then return 1; else return x? +B(x - 1); fi; end; (a) Trace B(5). (6) Explain in one sentence what this algorithm does. [X]