Name: Problems: Convert the infix expression a-(b + c)/d + e into postfix form using the following algorithm. You must show actions/operations and the status of the stack after each step of the algorithm in the table. Simply stating the answers will result in 0 points awarded. Convert an infix expression to postfix: As long as there are more tokens, get the next token. if the token is an operand, append it to the postfix string. if the token is "C", push it onto the stack. if the token is an operator, (order operators by precedence) if the stack is empty, push the operator onto the stack. if the stack is not empty, pop operators of greater or equal precedence from the stack and append them to postfix string, stop when you encounter "" or an operator of lower precedence or when the stack is empty. And then, push the new operator onto the stack. when you encounter a")", pop operators off the stack and append them to the end of the postfix string until you encounter matching "(". when you reach the end of the infix string, append the remaining content of the stack to the postfix string. 0-(b + c)/d+e Token Actions/Operations Stack( bottom to top) Postfix string b string until you encounter matching "(". when you reach the end of the infix string, append the remaining content of the stack to the postfix string a-(b + c)/d+e Token Actions/Operations Stack bottom to top) Postfix string a b > d