Please help me complete the code and find the postfix expression! Please read carefully.

Full points will be awarded, thanks in advance

Stack and Compiler Problem Consider the following algebraic expression: We want to convert this expression into the corresponding postfix expression using a stack. The stack interface is described below: class Stack [ public: /default constructor // destructor Stack( Stack( void push char newItem : // push a given character into the stack void pop( char&topItem : // pop and store the top item into the topItem void pop) // pop the top item This stack class does not have isEmpty and getTop methods. It also assumes no further pushes on the full stack and no further pops from the empty stack. The following is the main function that converts A+B/C- (D+E) *F into the postfix expression. Complete this main function. Also show the corresponding postfix expression. Note that you are allowed to use only the constants defined in the main function and the following three variables: stack, stackTop, and postfixExp. The stack variable temporarily stores operators; the stackTop character variable is used to receive the stack top item; and the postfixExp string variable stores the postfix expression you want to construct. The constants such as A, B, C, D, E, and F can be directly appended to postfixExp. (e.g., postfixExp A;). On the other hands, characters presenting an operator and left parenthesis such as '+','-', '*', '/' and ' must be first pushed into the stack variable. In other words, you are NOT allowed to write statements such that postfixExp +and postfixExp'. Those operator characters may be popped into the stackTop Variable and thereafter appended to posfixExp through the statement postfixExp + stackTop;. Don't use for/while loops. Just write all operations in sequential to convert this particular infix expression into the postfix notation. #include include "stack.h" using namespace std; const char A-'A' const char BB const char C- 'C' const char D- 'D' const char E-'E' const char FF' int main() Stack stack: Char stackTop String postfixExp; postfixExpA; stack.push+); // the 1 statement // the 2"d statement COMPLETE THE FOLLOWING PART */ 7/ the 2nd last statement stack.pop ( stackTop ) postfixExp-stackTo pexpressionhof last/ statement is "