Consider the following C$//$C$++$ code for the interpreter for the simplified infix expression.

$////$ keyboard input, single$-$digit numbers, no space, operations $(+,-,**,//,())$

CODE IN THE PICTURE

Assume that the input to this program is: $(3+7)//5$

$($a$)$ Show the activation tree. Please ignore showing atoiO.

$($b$)$ Show the run time stack $($one snapshot$)$ when the right$-$side parenthesis is processed. $(3+7)//5$

You don't have to show the details in each A$.$R$.-$ show only A$.$R$.$ names.