Question $2(20$ points$)$

Listen

$Q2(20$ points$)\_($Building expression Tree$)$:

Consider the following infix expression. Show the sequence of stack configurations for the Operand Stack $($Opstack$)$ and Tree Stack $($Tstack$)$ required to build the Expression Tree for the given infix expression. Show all work with details. Showing the final expression tree without showing stacks details receives no points.

$\frac{(A-B)+((R-x)**M)}{K}$#ooo