Task: Write the program in C++ using Project File. Evaluate a postfix expression using a stack. See Problem #12, pg. 387, in the Nyhoff textbook.

Input: The user will provide a postfix expression consisting of single-digit whole numbers and single-char operators (+, -, *, and /). The input should be accepted as a string.

Processing: Use a linked list stack implementation for the program. Only numbers will be stored in the stack. When a digit is read from the input string, it will be pushed onto the stack. When an operator is read from the string, two numbers will be popped from the stack and the operator will be used to evaluate them; then the result will be pushed back onto the stack.

Assume that only valid postfix expressions will be entered, so extensive data validation is not needed. Calculations will be done on the numbers as integers. Permit the user to enter multiple expressions for evaluation.

Output: As specified by Problem #12, pg. 387.

Sample expressions:

infix: postfix: result:

(2 + 7) * (3 - 6) 2 7 + 3 6 - * -27

3 - 4 - 1 + (5 / 2) 3 4 - 1 - 5 2 / + 0