Translating infix to postfix notation. An infix arithmetic expression consists of non-negative numbers, variables (identifiers), binary arithmetic operators +, -, * and / as well as parenthesis. Infix expressions are not necessarily fully parenthesized and usual operator preference and associativity apply. Write a program that translates infix arithmetic expressions to their postfix equivalent. Your program shall repeatedly request the user to input an expression and displays its postfix equivalent. Your program needs to detect as many syntax errors as possible. Please do this in JAVA and use stacks