Design the stack with all activation record instances, including static and dynamic chains, when execution reaches position $($A$)$ in the following skeletal program. Assume outer is at level $1.$

B$.$ Consider the following $C++$ skeletal program:

$4$ marks