5. Implement the following method. You may use the IntStack class and the Stack operations of push, pop. peek, isEmpty, and size. The parameter, in, is an Easy Reader from Appendix B of the text and it is already attached to some kind of input. You may use the methods: o in.isEOLN - returns true when the end of line is reached in.peek) s the next input character without actually reading it. in.ignore) -- reads and throws away the next input character inant Input () reads and returns an uteger value rom the EasyReader. it. us should be used on y f you know that the next input character orm a valid integer value. The method specification is public static int evaluatePostfix(EasyReader in) f properly torned posttix expression consisting of Integers / Postconditicn: The nethod has read the next input line (including Precondition (Nhich is not checked): The next input line of in is a the binary operations and ,arid spaces the nowline) and returned the value of the postfix expression 6. Consider the usual algorithm to convert an infix expression to a postfix expression. Suppose that you have read 10 input characters during a conversion and that the stack now contains these symbols battem Now, suppose that you read and process the 11th symbol of the input. Draw the stack for the case where the 1h symbol is: ,metulsat B. A left parenthesis: C. A right parenthesis: D. A minus sign: E. A division sign: 5. Implement the following method. You may use the IntStack class and the Stack operations of push, pop. peek, isEmpty, and size. The parameter, in, is an Easy Reader from Appendix B of the text and it is already attached to some kind of input. You may use the methods: o in.isEOLN - returns true when the end of line is reached in.peek) s the next input character without actually reading it. in.ignore) -- reads and throws away the next input character inant Input () reads and returns an uteger value rom the EasyReader. it. us should be used on y f you know that the next input character orm a valid integer value. The method specification is public static int evaluatePostfix(EasyReader in) f properly torned posttix expression consisting of Integers / Postconditicn: The nethod has read the next input line (including Precondition (Nhich is not checked): The next input line of in is a the binary operations and ,arid spaces the nowline) and returned the value of the postfix expression 6. Consider the usual algorithm to convert an infix expression to a postfix expression. Suppose that you have read 10 input characters during a conversion and that the stack now contains these symbols battem Now, suppose that you read and process the 11th symbol of the input. Draw the stack for the case where the 1h symbol is: ,metulsat B. A left parenthesis: C. A right parenthesis: D. A minus sign: E. A division sign