Convert the following infix expression into its equivalent expression tree using the algorithm described in class. Show the state of the algorithm after processing each symbol in the input: a * b / ( c + d - e * ( f + g ) / h )