the question didn't write what the operator so,will be add subtract divide plz follow the instructions and write a C code according to the instructions

Algorithm for Evaluation of Postfix Expression Create an empty stack and start scanning the postfix expression from left to right. If the element is an operand, push it into the stack. If the element is an operator o, pop twice and get A and B respectively. Calculate BOA and push it back to the stack. When the expression is ended, the value in the stack is the final answer. Evaluation of a postfix expression using a stack is explained in below example: 2 10 + 96-! pop 10 pop 2 push2 push 10 push 9 push 6 Pop 6 pop 9 Pop 3 pop 12 pop answer: 4 push 2 + 10 = 12 push 9 - 6 = 3 push 12 / 3 = 4 6 10 9 3 HT 2 12 12 12 4 OPERATOR () ** INFIX FORMAT (OPERAND OPERATOR OPERAND) 2 3 5 OPERAND OPERATOR OPERAND EX2 ] 3=5+2 U 15 + 2 17 EX3 4 * (2 +3) 1 2 ) 3 PREFIX ( OPERATOR OPERAND OPERAND) EX1 2 + 3 + 2 3 EX2 35+2 *35 + 2 + *352 POSTFIX (OPERAND OPERAND OPERATOR) EX1 2 + 3 23 + EX2 385+2 35* + 2 35* 2 + EX3 312 3 +43/2 3 + 4 3* / 2 13+43 27 343 4 2 / +