notes char stacktop(stk *stack/return the top value of the stack without popping the stack *if !(isempty(stack)return stack->data[stack->top]else return '\ 'int isempty(stk *stack/determine if stack is empty *if stack->top =- /empty *return else /not empty *return int isfull(stk *stack/determine if stack is full *if stack->top = /full *return else /not full *return void printresult(char infix[]char postfix[]/display the result postfix expression *printf("\ \ ")printf("infix notation /*system("cls");*% \ "infix)printf("postfix notation% \ \ "postfix)here are some results of the test run infix ( + )-( * / )+ - * /( - ( * ^ )-( % - )^ postfix + * /- * -/ ^* % - ^evaluating postfix expression an expression may be evaluated by making left to right scanstacking operands and evaluating operators using the correct number of operands from the stack and finally placing back the result on to the stack lovely professional university