notes *tptr printf" =% \ " )for-tptrtptr!= - -tptr *resptr+*tptr*resptr return resint main(char [ ]puts"enter infix freespaces max )gets( )while(*sputsin pre( )gets( )return explanation in an infix expressiona binary operator separates its operands ( unary operator precedes its operandin postfix expressionthe operands of an operator precede the operator in prefix expressionthe operator precedes its operands like postfixa prefix expression is parenthesis-freethat isany infix expression can be unambiguously written in its prefix equivalent without the need for parentheses to convert an infix expression to reverse-prefixit is scanned from right to left queue of operands is maintained noting that the order of operands in infix and prefix remains the same thuswhile scanning the infix expressionwhenever an operand is encounteredit is pushed in queue if the scanned element is right parenthesis (')')it is pushed in stack of operators if the scanned element is left parenthesis ('(')the queue of operands is emptied to the prefix outputfollowed by the popping of all the operators up tobut excludinga right parenthesis in the operator stack if the scanned element is an arbitrary operator othen the stack of operators is checked for operators with greater priority then such operators are popped and written to the prefix output after emptying the operand queue the operator is finally pushed to the stack when the scanning of the infix expression is completefirst the operand queueand then the operator stackare emptied to the prefix output any whitespace in the infix input is ignored thus the prefix output can be reversed to get the required prefix expression of the infix input question write program to implement queue by using an array lovely professional university