Question: For the infix expression a +b ^ c * d ^ e ^ f - g -h/(i + j), do the following:
a. Show how the operator precedence parsing algorithm generates the corresponding postfix expression.
b. Show how a postfix machine evaluates the resulting postfix expression.
c. Draw the resulting expression tree.