: Use a LinkedStack class instance to implement the algorithm convertToPostfix. (JAVA GENERICS)

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 (next character) Case variable: Append nextCharacter to postfix break case 'A operatorStack.push(nextCharacter) break case + case ''; case ''case while (!operatorStack isEmpty and precedence of nextCharacter precedence of operatorstack peek)) Append operatorStack peek) to postfix operatorStack.pop() operatorStack.push(nextCharacter) break case '( operatorStack.push(nextCharacter) break case ')'//stack is not empty if infix expression is valid topOperator - operatorStack.pop while (topOperator != '') Append topOperator to postfix topOperator - operatorStack.pop break default: break while operatorStack.isEmpty()) topOperator = operator Stack.pop Append topOperator to postfix } return postfix