Part II The following function traverses the binary tree to locate the node with a given key value.

struct tree$\_$node $*$ search$($struct tree$\_$node $*$ node,

int value$)$

i

if $($node$->$key $==$ value$)$

return node;

else if $($node$->$key $>$ value$)$ i

if $($node$->$left $==$ NULL$)$

return NULL;

else return search$($node$->$left, value$)$;

$\}$

else

if $($node$->$right $==$ NULL$)$

return NULL;

else return search$($node$->$right, value$)$;

$\}$

$\}$

Suppose we call search $($root$,04$ e$).$ Fill in the blanks the value of these memory location so that it shows the stack when the execution is at line $5.($More space than needed is provided. $)$ You can assume that the stack stores only arguments, return address, and the ebp register value. The value of ebp is $0xb$ ffff $880$ when the program calls the function. Write $"$rtn$\_$addr" for return addresses.

$\backslash$table$[[$Address$,$Value$],[0$xbffff$800,0$x$4$e$],[0$xbffff$7$fc$,0$x$804961$c$],[0$xbffff$7$f$8,$rtn$\_$addr$],[0$xbffff$7$f$4,],[0$xbffff$7$f$0,],[0$xbffff$7$ec$,],[0$xbffff$7$e$8,],[0$xbffff$7$e$4,],[0$xbffff$7$e$0,],[0$xbffff$7$dc$,],[0$xbffff$7$d$8,],[0$xbffff$7$d$4,],[0$xbffff$7$d$0,],[0$xbffff$7$cc$,],[0$xbffff$7$c$8,],[0$xbffff$7$c$4,]]$