2. Consider the following infix expressions: 1) 6 3 + 2 - 1+ 6/3 * 2 - 1 + (3 + 4/2 - 1) 2) (6. 12/3 +2*6/3) + (4 * (8 - 5)/2) + (6 + 10/(8-3*2)) 3)(8 + 6/03 - 1)*2 - 9 / (4-1)) - (4 -(8-2)/3) For each infix expression, a) 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 ( tor/)? 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