$1.$ Create a Stack class to hold integers using a vector.

$2.$ The Stack class should have the following methods:

$-$ push$($int value$)$: Adds an integer to the top of the stack.

$-$ pop$()$: Removes the top element from the stack.

$-$ top$()$: Returns the top element of the stack. If the stack is empty, throw an error.

$-$ isEmpty$()$: Returns true if the stack is empty, otherwise false.

Step $2$: Implement the Prefix Evaluation Function

$-$ Write a function evaluatePrefix$()$ that takes a prefix expression as a string and evaluates it using the Stack class.

$-$ Logic:

$1.$ Split the input string into tokens $($numbers and operators$).$

$2.$ Traverse the tokens from right to left.

$3.$ Use the stack to:

$-$ Push numbers onto the stack.

$-$ 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.

$-$ Handle errors:

$-$ Division by zero.

$-$ Invalid tokens $($non$-$numeric input$).$

$-$ Missing operands for an operator.

in C$++$