4 F PROBLEM F5-COMPUTER SYSTEMS Consider the following pseudocode algorithm for evaluating a postfix expression: for (each character ch in a string)( if (ch is an operand) ( push value of ch onto stack elset // ch is an operator named op operand2 pop top of stack: operand1- pop top of stack; result - operandi op operand2; push result onto stack; I/ end else / end for The value is the top of the stack Evaluate the following postfix expression using the algorithm above, assuming the variable values a = 73c= 12.d =-be = 1. Show the status of the stack at each step of the algorithm. ab+c-de + In here, is the multiplication sign