Suppose the stack pointer SP is initialized to $0$x$20000600.$

A recursive function A recursive assembly code

int factorial$($int n$)$;

int main$($void$)\{$

factorial$(3)$;

return $0$;

$\}$

int factorial$($int n$)\{$

int f;

if$($n$==1)$

return $1$;

else

f $=$ n$*$factorial$($n$1)$;

return f;

$\}$

$0$x$08000130$

$0$x$08000134$

$0$x$08000136$

$0$x$08000138$

$0$x$0800013$A

$0$x$0800013$C

$0$x$0800013$E

$0$x$08000140$

$0$x$08000142$

$0$x$08000144$

$0$x$08000148$

$0$x$0800014$C

AREA main, CODE, READONLY

EXPORT $\_\_$main

ENTRY

$\_\_$main PROC

MOV r$0,$ #$0$x$03$

BL factorial

stop B stop

ENDP

factorial

PUSH $\{$r$4,$ lr$\}$

MOV r$4,$ r$0$

CMP r$4,$ #$0$x$01$

BNE NZ

MOVS r$0,$ #$0$x$01$

loop POP $\{$r$4,$ pc$\}$

NZ SUBS r$0,$ r$4,$ #$1$

BL factorial

MUL r$0,$ r$4,$ r$0$

B loop

END

Show the stack content when factorial$(1)$ is returned.

$0$x$20000618$

$0$x$20000614$

$0$x$20000610$

$0$x$2000060$C

$0$x$20000608$

$0$x$20000604$

$0$x$20000600$

$0$x$200005$FC

$0$x$200005$F$8$

$0$x$200005$F$4$

$0$x$200005$F$0$

$0$x$200005$EC

$0$x$200005$E$8$

$0$x$200005$E$4$

$0$x$200005$E$0$

$0$x$200005$DC

$0$x$200005$D$8$

$0$x$200005$D$4$

$0$x$200005$D$0$

$0$x$200005$CC

$0$x$200005$C$8$

$0$x$200005$C$4$