1.10. Trace the following algorithm to determine its output by a call to whatdoido(6). procedure whatdoido ( n : integer) if n0 then return print n whatdoido (n2) whatdoido (n3) print n 1.11. Give the sequence of integers written by a call to whatdoido(6). procedure whatdoido ( n : integer) if n0 then return 0 return whatdoido (n3)+ whatdoido (n2) 1.12. Criticize the following recursive procedure: procedure whatdoido ( n : integer) m:= whatdoido (n3)+ whatdoido (n2) if n0 then return 0 return m