This is in java, please use a stack created with an array

Postfix evaluation For example: For a postfix expression: 10 2 8 3 We can use stack to solve it Policy: maintain a stack and scan the postfix expression from left to right If the element is a number, push it into the stack If the element is a operator O pop twice and get A and Brespectively. Calculate BOA and push it back to the stack When the expression is ended the number in the stack is the final