Consider the following program: A : { ... void p () { ... void r () { ... } ... q (); ... r (); ... } void q () { ... if (...) then p (); ... } void s () { ... } s (); ... B : { ... p (); ... } ... } Suppose we enter the blocks in this order: enter A; enter s; enter B; enter p; enter q; enter p; enter q; enter r; enter r Complete above sequence with information about when each block is exited. Draw the frame stack state for each of the 18 points of execution time, including the dynamic and static chain pointers. Explain by describing how the program is executed.

Draw eighteen images of the stack corresponding to the stack state immediately after each entry and exit.