Please show solution and comments for this data structure using java.?
Implement a program in Java to convert an infix expression that includes (, ), +, -, *, and / to postfix expression.
For simplicity, your program will read from standard input (until the user enters the symbol "=") an infix expression of single lower case and the operators +, -, /, *, and ( ), and output a postfix expression.