Complete the progression of the function call stack for the program in the given table at the end of this document. Each time there is a new function call or a function returns, there should be a depiction of the call stack. This is shown by adding the new function call on top of the previous function calls or removing the function on top when a value is returned by that function. the first coulumn on the left is a depiction of the call stack and every other column must be filled with respect to that. Please notice that every time the stack changes, it must be written in the next row again.:

#include void fun(int x) { if(x > 0) { fun(--x); printf("%d\t", x); fun (--x); int main() { int a = 3; fun(a); return 0; Call stack Table 1: Question 1 part b: funcion call stack table Last function call | Last function Function parameters (if applicable) return (for function that is (if applicable) called or returned) Output value (if application) main N/A N/A N/A main a=3 I = a fun =3 main a=3 = 3 fun N/A =3 N/A fun I= 2 = 2 fun = 3 main a=3 I=3 4 fun =3 main a = 3 = 3 5 fun I= 3 main a = 3 I=3 Call stack Last function call | Last function (if applicable) (if applicable) Function parameters (for function that is called or returned) Output value (if application) fun =1 fun = 2 fun N/A fun I=0 = 3 main a=3 = 3 fun I = -1 fun c = 1 fun I= 2 fun I=3 main a=3 I=3 I= -1 Call stack Last function call | Last function (if applicable) return (if applicable) Function parameters (for function that is called or returned) Output value (if application) fun x = 3 main I = 2 a=3 x = 3 Call stack Last function call | Last function (if applicable) return (if applicable) Function parameters (for function that is called or returned) Output value (if application) 15 fun I = 1 fun = 3 main a = 3 x=3 fun = -1 fun = 1 fun I=3 main a=3 x=3 16 fun I= -1