Infix and postfix notations are two different ways of writing arithmetic expressions. Please see the URL below for more details on the two notations. http://www.cs.man.ac.uk/~pjj/cs2121/fix.html Write...

Please solve the question properly following all the instructions given using c++.check all possible test cases.and do send the screenshot also.

Extracted text: Infix and postfix notations are two different ways of writing arithmetic expressions. Please see the URL below for more details on the two notations. http://www.cs.man.ac.uk/~pjj/cs2121/fix.html Write a program to evaluate infix expressions using the stack created in problem 1. Your pro- gram should read the expression as input string and evaluate it in a single pass. (Hint: You have to use the infix to postfix conversion algorithm and postfix evaluation algorithm us- ing two stacks - one stack for the operands and one stack for the operators. The infix to postfix con- version algorithm is explained in the following URL: http://csis.pace.edu/~wolf/CS122/infix-postfix.htm The postfix evaluation algorithm is explained in the following URL: https://scriptasylum.com/tutorials/infix_postfix/algorithms/postfix-evaluation/ The infix expression can contain: 1. Integers 2. +' and ** operators 3. (' and ')' parentheses As usual, * operator has higher precedence than + operator. Both * and + are left associative.