Answer the following questions related to the implementation of a simple calculator discussed in Chapter 3. (1) Show your understanding about the postfix() algorithm discussed in the lecture note and the textbook by showing how to convert the following 2 infix expressions into their postfix expression using a stack step by step. 9/3 - 2 + 4 * 2 - 1 * 6 (((a + b) * (c + d) + f) * g - h Show your understanding about the eval() algorithm by showing how you evaluate the first infix expression given in (1) using a stack step by step. Assume that you have to handle plus and minus and signs ONLY, for example, -2 - +1 + 4 - 3. Show a pseudo code on how you evaluate such infix expressions with explanations