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