For the following sub$-$problems, consider the following program:

float bar$($int r$,$ int s$)\{$ float i; i $=20\mathrm{.}0+($r $+$ s$)$; return i; $\}$ int foo$1($int a $,$ int b$)\{$ float g; g $=$ bar$($b$,$ a$)$; return $($int$)$g; $\}$ int foo$2($int a $,$ int b$)\{$ float h; h $=$ bar$($a$,$ b$)$; return $($int$)$h; $\}$ void main$()\{$ int x; int y; float f; x $=1+$ x $*$ y; y $=$ foo$1($x$,$ y$)+$ foo$2($x$,$ y$)$; $...//$some computations $\}$

Question $1\mathrm{.}1$

Q$1\mathrm{.}1$

$10$ Points

Grading comment:

Assume your program is running on a machine with $4$ registers, using callee saves. Assume address $($i$.$e$.,$ pointers$)$ are $8$ bytes, floats are $4$ bytes and ints are $4$ bytes. Draw the complete stack $($i$.$e$.,$ the stack including all active activation records$)$ for the program right after the first time bar has been called, and before bar returns. For each slot in the stack, indicate what is stored there, and how much space that slot takes up$.$