1. Create a Stack class to hold integers using a vector.
2. The Stack class should have the following methods:
\textbullet{} push(int value): Adds an integer to the top of the stack.
\textbullet{} pop(): Removes the top element from the stack.
\textbullet{} top(): Returns the top element of the stack. If the stack is empty,
throw an error.
\textbullet{} isEmpty(): Returns true if the stack is empty, otherwise false.
Step 2: Implement the Prefix Evaluation Function (10 Marks)
\textbullet{} Write a function evaluatePrefix() that takes a prefix expression as a string
and evaluates it using the Stack class.
\textbullet{} Logic:
1. Split the input string into tokens (numbers and operators).
2. Traverse the tokens from right to left.
3. Use the stack to:
\textbullet{} Push numbers onto the stack.
\textbullet{} When an operator is encountered, pop two numbers, apply
the operation, and push the result back onto the stack.
4. Return the result from the stack.
\textbullet{} Handle errors:
\textbullet{} Division by zero.
\textbullet{} Invalid tokens (non-numeric input).
\textbullet{} Missing operands for an operator.
Step 3: Test Your Code with Provided Test Cases (5 Marks)
\textbullet{} Test your implementation on the test cases mentioned in main.
\textbullet{} Ensure all test cases, including edge cases, produce the expected results.
