In Fig. 7.9 is C code to compute Fibonacci numbers recursively. Suppose that the activation record for / includes the following elements in order: (return value, argument n, local s, local t); there...

In Fig. 7.9 is C code to compute Fibonacci numbers recursively. Suppose that the activation record for / includes the following elements in order: (return value, argument n, local s, local t); there will normally be other elements in the activation record as well. The questions below assume that the initial call is /(5).

a) Show the complete activation tree.


b) What does the stack and its activation records look like the first time /(l ) is about to return?


! c) What does the stack and its activation records look like the fifth time /(l ) is about to return?

Fig. 7.9