implement a class of infix calculators.

Consider simple infix expressionthat consist of single digit operands; the operators +, -, *, and / ; and parentheses. Assume that unary operators are illegal and that the expression contains no embedded spaces.

Design and implement a class of infix calculators. Use the algorithms given in the chapter 6 to evaluate infix expressions as entered into the calculator. You must first convert the infix expression to postfix form and then evaluate the resulting postfix expression.

You need to implement a driver function that takes one line of infix expression either from console or an input file infix.dat, and print out the post fix expression and calculated result to the console.