Part $2$: Memory $(30$ marks$)$

For the recursive functions in Part $1$ A and B$,$ describe the stack frames for the provided

test values. Show which stack frames are popped and which remain on the stack while the

function processes up until the final base case is returned $($meaning no further processing when

the final base case is reached$).$

Part $2$ A: $(15$ marks$)$

Fibonacci where N$=4$