Problem:
Question 1- Given the following infix expression: a*b-c*d-(e-(f/h+i)*j-k)*g Use a set of diagrams to trace the algorithm to produce the postfix expression, and then trace the algorithm to evaluate the postfix expression. (sketch it)
Question 2- Write a function to transform any infix expression to a postfix expression, and test the function using the expression in question #1, and all example expressions discussed in class. You may assume that each variable is a single letter, and the expressions only involves the four binary operators: +, -, *, and /.
Show your calculations, but you do not need to write out any explanation.