The computer language is Java

Program 2 Write a program that converts an infix expression into an equivalent postfix expression. For this assignment, do not worry about invalid expressions only consider correct infix notation. Guidelincs for converting infix to postfix: 1. Deline two slring g variables for holding both expressions: String infr String prstfr 2. Define a stack for holding operators and the open parentheses' 3. Use a loop structure to examine each element, token, in the intx string: . If the token is an operand, 'A' -Z' then append the character to the postfx string . If the token is an operator G +, *, /,%) then you need to do two things: Pop and append all the operators from the stack to the postfx string variable that have precedence greater than or equal to the operator you are examining. . Push the token onto the stack 4. Alier prucessing the infx string, some uperators might be leli on the slack. Pup and append all remaining slack elements to the postfx string. 5. Finally, test your program on thefollowing input This program will read an infix expressio n and convert it to a postfix expression Enter an infix expression (do not use spaccs): X+Y*Z This expression converted to p ostfix is XYZ* Enter an infix expression (do not use spaces): X+Y*ZX is expression converted to postfix is XYz X+ Enter an infix expressin (do not use spaces): A B CDIE This expression converted to postfix is ABC D*+E+