Part III: Recursive Algorithms (30 pt.) Given the following recursive algorithm: procedure foo(x, y) Trput: x: integer, y: nonnegative integer Output:?? if y--e then return x else return (foo(x, y-1)) 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. .x-4 and y-e. That is, show all steps performed by the algorithm for these inputs