(8 pts) Consider the following C function: #include int factorial (int n) { int temp; }...

 

Transcribed Image Text:

(8 pts) Consider the following C function: #include int factorial (int n) { int temp; } if (n=1) { } return n; temp factorial (n-1) n; return temp; int main(void) { } = int result factorial (3); printf("Result = %d ", result); Consider all possible states of the call stack during the execution of this program. What is the largest depth (i.e. the greatest number of activation records) of the call stack for this execution? For this largest depth, show all activation records that are on the stack at the moment just before the top activation record is about to be popped. You should indicate the current value of the AP & SP pointers (use arrows), and for each record you should show: return AP address (use an arrow) value of formal parameters value of local variables You DO NOT need to show the value of the PC or the return PC address. You also do not need to show how the procedure return value is handled. (8 pts) Consider the following C function: #include int factorial (int n) { int temp; } if (n=1) { } return n; temp factorial (n-1) n; return temp; int main(void) { } = int result factorial (3); printf("Result = %d ", result); Consider all possible states of the call stack during the execution of this program. What is the largest depth (i.e. the greatest number of activation records) of the call stack for this execution? For this largest depth, show all activation records that are on the stack at the moment just before the top activation record is about to be popped. You should indicate the current value of the AP & SP pointers (use arrows), and for each record you should show: return AP address (use an arrow) value of formal parameters value of local variables You DO NOT need to show the value of the PC or the return PC address. You also do not need to show how the procedure return value is handled.