procedure foo(x, y) Input: x: integer, y: nonnegative integer Output?? if y-0 then return x else return (foo(x, y-1))3 1. (8 pt., 2 pt. each) Trace algorithm foo for each of the following inputs: .x-1 and y-1. x-2 and y-3. x-3 and y 2. That is, show all steps performed by the algorithm for these inputs