Solve it in Java

Here is the algorithm If you read a number Push it on the number stack. Else if you read al Push it on the operator stack. Else if you read an operator of While the top of the stock has a higher precedence than op Evaluate the top. Push op on the operator stack. Else if you read a) While the top of the stack is not al Evaluate the top. Pop the (. Else if there is no more input While the operator stack is not empty Evaluate the top. At the end, the remaining value on the number stack is the value of the expression. The algorithm makes use of this helper method that evaluates the topmost opera tor with the topmost numbers: Evaluate the top Pop two numbers off the number stack. Pop an operator off the operator stack. Combine the numbers with that operator Push the result on the number stack