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:

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

Traverse the tokens from right to left.

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.

Return the result from the stack.

Handle errors:

Division by zero.

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

Missing operands for an operator.

Test your implementation on the test cases mentioned in main.

Ensure all test cases, including edge cases, produce the expected results.

C$++$

Stack Class below

#include

#include

#include

#include

#include

using namespace std;

$//$ Stack Definitions

class Stack

$\{$

private:

vector test;

public:

void push$($int x$)$

$\{$

test.push$\_$back$($x$)$;

$\}$

void pop$()$

$\{$

if $($test$.$empty$())\{$

cout $$"Empty Stack";

$\}$

else $\{$

int temp $=$ test.back$()$;

test.pop$\_$back$()$;

cout $$ temp;

$\}$

$\}$

int top$()$

$\{$

if$($test$.$empty$())\{$

cout $$"Empty Stack";

return $1$;

$\}$

else $\{$

return test.back$()$;

$\}$

$\}$

bool isEmpty$()$

$\{$

return test.empty$()$;

$\}$

$\}$;