Question 1: By tracing the discussed algorithm regarding how to convert an infix expression into a postfix expression, please explain in a step-by-step manner how to convert the example infix expression (((1+2)-(3-4))/(6-5)) to the postfix expression 1 2 + 3 4 - - 6 5 - /

Please show me how the content of the evaluation stack is changed after each item(an operator, an operand, or a parenthesis) is processed and how the postfix expression is built up step-by-step.

Question 2: please evaluate the following postfix expression and write your answer. Show the state of the evaluation stack just before the first arithmetic operation is applied and then just after each additional operation is performed. All operands listed below are single-digit integers. All arithmetic is integer arithmetic.

Postfix expression: 1 2 + 3 4 - - 6 5 - /