Show all the calculations and the algorithm is given below:

Derive the complexity and Big-Oh expressions of the algorithm for evaluating a postfix expression where n is the number of operands in the expression. Take all operators as binary operators. Algorithm (Evaluate Postfix) EvalPostfix (P, VALUE) This algorithm finds the VALUE of an arithmetic expression P written in postfix notation. The algorithm uses a STACK to store intermediate results. 1. Add a right parenthesis J at the end of P. (This acts as a sentinel] 2. Scan P from left to right and REPEAT steps 3 and 4 for each element of P UNTIL the sentinel) is encountered. 3. IF an operand is encountered, put it on STACK 4. IF an operatoris encountered, THEN (a)Remove the two top elements of STACK, where A is the top element and B is the next-to-top element. (b) Evaluate BA (c) Place the result of (b) back on STACK ENDIF ENDREPEAT 5. SET VALUE equal to the top element on STACK 6. EXIT