(5 marks). Assume the following skeletal program is implemented using the shallow-access method using a stack for each variable name. Show the stacks when execution reaches position 1. [The program has been modified from the textbook] 5. void fun10 t int a void fun20t int c, d; void fun3 ( int d; void main int a, b, c The calling sequence for this program for execution to reach fun3 is: main calls fun2 fun2 calls funl funI calls funl funl calls fun3