Write a program that uses the stack algorithm we discussed in class to evaluate postfix expressions entered by the user. The program should support expressions involving any double values (positive, negative, or zero) and any combination of these operators:

+ addition - subtraction * multiplication / division % mod (remainder) ^ exponentiation (e.g., 7^2 = 49)

You can use the built-in java.util.Stack class to keep track of your operands. Assume that all tokens in the postfix expression are separated by spaces. The program should show an appropriate message if the expression entered by the user has too many or too few operands. Also display an error message if the expression contains anything besides numbers and the six operators above.

Heres an example of what your program might look like while running. The underlined portions indicate user input.

Enter a postfix expression X to exit: 1 2 3 Result 3.0 Enter a postfix expression X to exit: 1 2 3 Too many operands Enter a postfix expression X to exit: 1 2 3 A Too few operands Enter a postfix expression X to exit a b Unsupported operand/operator type