notes char pop(stk *stack)char stacktop(stk *stack)int isempty(stk *stack)int isfull(stk *stack)void printresult(char infix[]char postfix[])/*void print_msg(void);*/program entry point *int main(voidchar infix[ ]postfix[ ]=""/convert from infix to postfix main function *converttopostfix(infixpostfix)/display the postfix equivalent *infix[strlen(infix)- '\ 'printresult(infixpostfix)return( )void initstack(stk *stack/initalise the stack *stack->top - /stack is initially empty *void get_infix(char infix[]/get infix expression from user *int iprintf("enter infix expression below (max characters excluding spaces\ ")fflush(stdin)for = < /to read in only characters excluding spaces *if (infix[igetchar()='\ni++breakelse if !(isspace(infix[ ]) ++infix[ '\ 'void converttopostfix(char infix[]char postfix[]/convert the infix expression to postfix notation *int ilengthj= lovely professional university