P-5.12:Implement a program that can input an expression in postfix notation (see C-5.8 below) and output its value.

C-5.8: Postfix notation is an unambiguous way of writing an arithmetic expression without parentheses. It is defined so that if (exp₁) o (exp₂) is a normal fully parenthesized expression whose operation is o, then the postfix version of this is pexp₁pexp₂o, where pexp₁ is the postfix version of exp₁ and pexp₂ is the postfix version of exp₂. The postfix version of a single number or variable is just that number or variable. So, for example, the postfix version of ((5 + 2) * (8 3))/4 is 5 2 + 8 3 * 4 /. Describe a nonrecursive way of evaluating an expression in postfix notation.