Create a class for infix expression calculation using the two-stack method. Use the stack template for each of your stacks. Use the queue template for any queue like functions that you may need.

Perform the calculation by first changing the infix expression into post-fix expression. Output to the console the post-fix expression that was generated as well as the result of the expression.

Then verify your result by repeating the process with converting to a pre-fix expression. Again, output the pre-fix expression to the console.

Assume the operands in the input expression will be any-size operands but successive operands/operators are separated spaces. Perform adequate expression verification to ensure that it is a well-formed expression before you perform the calculation. If it is mal-formed, inform the user accordingly.

You should allow all binary arithmetic operators (+, -, *, /, %) and the parentheses.

Unary operators (negation) can be treated as illegal.