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.

Suppose that the procedure f multiplies its input x by the factor n (not to be confused with N the number of procedure calls) and that is the output of f.

Write MIPS code for

a) The procedure calling mechanism (including stack frame handling)

b) The called procedure (if different from the one in a).