Suppose we have a program f that inputs a 32-bit words x and n, has 32-bit integer internal variables j and k, and outputs a 32-bit word z. The program f calls itself N times (i.e., winds up the stack), then unwinds the stack by reversing the recursion (like the factorial example in the viewgraphs) until a final result is reached.

a) Draw a picture of what each procedure-calls stack frame will look like

b) Label the variables

c ) Compute the size of the stack when all the N procedure calls are executed just before the recursion begins to unwind. Hint : N procedure calls produces how many stack frames?