Consider the following C function:

Consider all possible states of the run-time call stack during the execution of this program. What is the largest depth (i.e., number of activation records) of the call stack that can be observed during this period of time?

For this largest depth, show all activation records that are on the stack, for the moment of time just before the top activation record is about to be popped. You do not need to show registers AP/SP/PC, nor the AP and return address slots on the stack, nor the contents of the code segment. Show clearly (1) each activation record and the program function it corresponds to; (2) the local variables and formal parameters in each of these records; (3) the values stored in the local variables and parameters on the stack (show ? for uninitialized variables).

There should be no coding for this answer! Please answer all in bold, other info is supplemental.

void main(.. .) int result-fib(3); printf( "Result %d ", result); int fib(int n) if (n