This is a Java question. Please answer, thank you!

Algorithm convertToPostFix 5.16:

3. Refer to algorithm convertToPostfix, as in Segment 5.16 of the textbook and as discussed in class presentation. Define a class MyExpression Converter and use the above-mentioned algorithm to create the following static method for this stated class: (a) ConvertToPostfix (String infixString) (20 pts] - This method takes 1 String argument that is an infix expression - Return a postfix version of this infixString (b) Using this method, convert the following infix expression strings to postfix[15 pts) (i) a*b/(c-d) (ii) (a-b*c)/(d*e*f+g) (iii) a/b* (c+(d-e)) : case case Algorithm convertToPostfix(infix) 1/ 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) next character = next nonblank character of infix switch (nextCharacter) { case variable: Append nextCharacter to postfix break case" operatorstack.push(nextCharacter) break case '+' "*' : case '/' : while (! operatorStack.isEmpty() and precedence of nextCharacter