In C++

Implement the array-based stack class. Use it in the client code to convert and compute post-fix expressions.

The postfix expressions are saved in a file named "postfix.txt", one expression each line.

For simplicity, you may assume all numbers in the expressions are single digit numbers.

Show

1.Source code: the stack class and the client code;

2.Output screen capture: show the results for the following expressions (The errors in some expressions are intentional. Your code must detect it and output an error message):

3 7 +

3 7 2 * +

3 7 + 2 *

* 3 7 2 4 - * 5 + 2 * 9 + 4 8 - * + 1

3 7 2 4 - * 5 + 2 * 9 + 4 8 - * + 1 - +

3 7 2 4 - * 5 + * 2 * 9 + 4 8 - * + 1

3 7 2 4 - * 5 + 2 * 9 + 4 8 - * + 1 -