2 Non-local data lookup This problem uses the following procedure. This procedure uses static (lexi- cal) scoping procedure main(): int a; procedure proci(int i): int b; b = a + 1; procedure recursion(int k): print b; b = b - 1; if (b > 1): recursion(k * b); else: a = k; end recursion b = b + i; recursion (1); end proci a = 1; proc1(4); print a; end main (a) What does this procedure print? (Give the output of procedure main().) (b) Rewrite the procedure main() where each variable (argument vari- ables, declared variables, procedure names) is renamed by their level, offset) pairs. (c) How does procedure procl find variable a in instruction b = a + 1;? Show the RISC instructions corresponding to the high-level instruc- tion b = a + 1; in this procedure. You should use the same ILOC instruction format as used in class. (d) Show the stack frames the last time the procedure recursion is called. In particular, show the status of the stack in between the instruction 2 Non-local data lookup This problem uses the following procedure. This procedure uses static (lexi- cal) scoping procedure main(): int a; procedure proci(int i): int b; b = a + 1; procedure recursion(int k): print b; b = b - 1; if (b > 1): recursion(k * b); else: a = k; end recursion b = b + i; recursion (1); end proci a = 1; proc1(4); print a; end main (a) What does this procedure print? (Give the output of procedure main().) (b) Rewrite the procedure main() where each variable (argument vari- ables, declared variables, procedure names) is renamed by their level, offset) pairs. (c) How does procedure procl find variable a in instruction b = a + 1;? Show the RISC instructions corresponding to the high-level instruc- tion b = a + 1; in this procedure. You should use the same ILOC instruction format as used in class. (d) Show the stack frames the last time the procedure recursion is called. In particular, show the status of the stack in between the instruction