If someone can help with this. I need this for Java language

Infix notation is an expression like this: 3 + 2 * 5 In this step you are to create a calculator that allows for expression like me above Your calculator should support +, -, *, /. This is an extremely difficult thing to solve because we need to consider the operator precedence. Probably the best way to solve the problem is to convert the infix to postfix(RPN). You may be wondering how to convert from infix to postfix. Well. there are several algorithms out there that you can find. What I would like for you to do is find one or two from the Internet and share them with your fellow students by posting what you think is the best one Also. It might help to give some insight as to how you implemented it. Here is a link to one that I found in pretty short order: http://everything2.com/title/Infix+to+postfix+conversion+algorithm Your infix notation calculator must be derived from RPN Calculator. In my mind you are going to want to use the input parser and the RPN algorithm once the infix has been converted to postfix