Can you please help me on this homework question, and also provide explaination on how to do this problem

1. (10 pts) Show the run-time stack with all activation record instances, including static and dynamic chains, when execution reaches position 1 in the following skeletal program (in C-style syntax). Assume that the programming language is statically scoped but does not allow functions as return values. void Foo ) I void B (int); void A O i void c O // position 1 C Oi void B (int flag) ( void D O f if (flag) A Oi else D O B (0) The calling sequence for this program for execution to reach C is: main calls Foo, Foo calls B, B calls D, D calls B, B calls A, and A calls C