This is my homework.  Kindly help me check it?The instructions are:Implement an infix expression to postfix expression converter. You are to implement the infix to postfix algorithm presented in the lecture. You are to use only the stack that was provided in the lab lecture. The use of the stack of JDK or any other stack is not allowed. The supported operators are +, -, *, / and ^. Grouping operator are ( and ).Input: Infix expresseion where each token (operand and operator) are space-separated (console-based). Explore the StringTokenizer class for tokenizing (separating the infix expression into tokesn) the input. The book of Deitel and Deitel has examples on how to use StringTokenizer.Output: Postfix expression (console-based). The tokens (operand and operator) are also space-separated in the output. The code I wrote is:import java.util.*;public class PostfixConverter {private String infixExpression;public PostfixConverter(String infixExpression) {this.infixExpression = infixExpression;}private String convertInfixExpression() {StringTokenizer tokens = new StringTokenizer(infixExpression);Stack operatorStack = new ArrayStack();String converted = ;while(tokens.hasMoreTokens()) {    String token = tokens.nextToken();    if(token.equals(()) {        operatorStack.push(new String(token));    }    else if(token.equals())) {        while(operatorStack.top().equals(() != true) {                converted = converted +   + operatorStack.pop();            }        if(operatorStack.top().equals(()) {            operatorStack.pop();        }    }    else if (isOperator(token)){        if(operatorStack.isEmpty() == true) {            operatorStack.push(new String(token));        }        else {            if(ICP(token) < ISP((String) operatorStack.top())) {                converted = converted +   + operatorStack.pop();                operatorStack.push(token);            }            else {                operatorStack.push(new String(token));            }        }    }    else {        converted = converted +   + new String(token);    }}while(operatorStack.isEmpty() != true) {    converted = converted +   + operatorStack.pop();    }return converted;}public int ISP(String token) {int precedence = 0;if(token.equals(+)|| token.equals(-)) {    precedence = 2;}else if(token.equals(*) || token.equals(/)) {    precedence = 4;}else if(token.equals(^)) {    precedence = 5;}else if(token.equals(()) {    precedence = 0;}return precedence;}public int ICP(String token) {int precedence = 0;if(token.equals(+)|| token.equals(-)) {    precedence = 1;}else if(token.equals(*) || token.equals(/)) {    precedence = 3;}else if(token.equals(^)) {    precedence = 6;}return precedence;}private boolean isOperator(String token) {return (token.equals(+) ||         token.equals(-) ||         token.equals(*) ||         token.equals(/) ||        token.equals(^) );            }public static void main(String[] args) {System.out.println(Input the infix expression          + (operands, operators are separated by spaces):);Scanner input = new Scanner(System.in);String infixExpression = input.nextLine();PostfixConverter converter = new PostfixConverter(infixExpression);System.out.println(The converted expression is  +         converter.convertInfixExpression());}}
Infix to Postfix Converter Program
java;parsing;homework;math expression eval