A postfix expression evaluator works on arithmetic statements that take the following form:
op1 op2 operator...
Using two stacks, one for the operands and one for the operators, design and implement a Calculator class that converts infix expressions to postfix expressions and then uses the stacks to evaluate the expressions.