data structures using for exampleconsider the prefix expression let us now apply the algorithm to evaluate this expression programming example write program to evaluate prefix expression figure algorithm for evaluation of prefix expression character scanned operand stack #include #include #include int stk[ ]int top=- int pop()void push(int)int main(char prefix[ ]int lenvaliopr opr resclrscr()printf("\ enter the prefix expression ")gets(prefix)len strlen(prefix)for( =len- ; >= ; --switch(get_type(prefix[ ]) case val prefix[ ' ' push(val) break case opr pop() opr pop() switch(prefix[ ] case '+'res opr opr breakcase '-'res opr opr breakcase '*'res opr opr breakcase '/'res opr opr breakpush(res)printf("\ result % "stk[ ])getche()return void push(int valstk[++topval