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

Stack class given below

class Stack

$\{$ private: $//$ The vector to store stack elements vector v; public: $//$ Function to push an element onto the stack void push$($int data$)\{$ v$.$push$\_$back$($data$)$; cout $$ "Pushed: $"$ data $$ endl; $\}//$ Function to pop an element from the stack int pop$()\{$ if $($isEmpty$())\{$ cout $$ "Stack is empty. Cannot pop.

$"$; return $-1$; $\}$ int top $=$ v$.$back$()$; v$.$pop$\_$back$()$; cout

Popped: $"$ top $$ endl; return top; $\}//$ Function to get the top element of the stack without $//$ removing it int top$()\{$ if $($isEmpty$())\{$ cout $$ "Stack is empty. No top element.

$"$; return $-1$; $\}$ return v$.$back$()$; $\}//$ Function to check if the stack is empty bool isEmpty$()\{$ return v$.$empty$()$; $\}\}$;