Consider the following infix expressions:

a) (5 - 12 / 3 + 2 * 6 / 3 ) + (4 * (8 - 5) / 2) + (6 + 10 / ( 8 3 * 2))

b) ( 8 + 6 / ( 3 1 ) * 2 9 / ( 4 1 ) ) ( 4 ( 8 2 ) / 3 )

For each infix expression,

1. show how to convert each infix expression to its postfix expression step-by-step. To show it, what is the stack status each time right after proceeding each operator (+, -, *, or /)? And what is the total number of push operations and pop operations done for each expression?

The postfix expression?

The total number of push operations? ___________

The total number of pop operations? ___________

b) based on your answers of a), trace the evaluation (computation) of the postfix expression using stack step-by step.

- THE