If someone could explain how to do this problem it would be great, thanks.

In the previous assignment, you wrote a Java program that prompted the user for an infix expression and converted the result to postfix, displaying the result in the console window In this assignment, instead of simply displaying the postfix, you will implement a simple interpreter that evaluates the expression, and returns an ordered sequence on one and two operand expressions that can subsequently be evaluated by a simple processor. The point of this assignment is to understand the Stack Interpreter outlined in the Appendix of Assignment 3 Consider the following example: atc*y-d*ix The corresponding Postfix expression is: acy*+dx*- Following the convention of Assignment 3, the expression would be evaluated as follows: Token Stack a c a c y ult of an operation which is subsequently placed back on The indicate the res the stack for further evaluation until all operators have been processed. Your program should list these operations as follows: Infix to Postfix Interpreter Enter expression (blank line to exit): atc y-d*x Evall: Eval4: