Write a java code to implement the infix to postfix algorithm as described below.

Algorithm convertToPostfix(infix) // Converts an infix expression to an equivalent postfix expression. operatorStack = a new empty stack postfix = a new empty string while (infix has characters left to parse) nextCharacter = next nonblank character of infix switch (nextCharacter) case variable: Append nextCharacter to postfix break case 'A': operatorStack.push(nextCharacter) break case '+' : case '-' : case '*'; case '/' : while (!operatorStack.isEmpty() and precedence of nextCharacter