Data Stucture

Question No. 2: Evaluate the following postfix expression 2 3 * 3 1 + 2 * 7 - ^ using stack. Show the trace of the algorithm, draw and fill the following table on answer sheet. Postfix Expression: 2 3 * 3 1 + 2 * 7 - ^ Step No. Input Operand 1 Operand 2 Stack 1 2 ... CLO 1 5 Marks Question No. 3: Convert the infix expression ( ( A + B ) * C - (D - E) ) ^ ( F + G) to postfix. Show the trace of the algorithm, i.e., the stack, the infix expression and the postfix expression. Draw and fill the following table on answer sheet. Infix Expression: ( ( A + B ) * C - (D - E ) ) ^ ( F +G) Step No. Symbol Postfix string Stack 1 2 W CLO 1 5 Marks