Help with C++ please!

Read an infix expression from an input file and convert to postfix. Instead of displaying directly on the screen, first place in a queue, and then display the contents of the queue on the screern Precondition: . The expression will be read from a file (input.txt) that contains a single line. There will be no spaces between the operands and the operators. . The following operators are allowed: ()+-*/ o The normal rules of precedence will apply No error checking is necessary . The numbers will all be greater than O and less than 10 (positive, single digit numbers) Example: 1+2 converts to 12+ Hint: int precedence(char operator) assign a number to the operator based on precedence 0 Return the number void infixPostfix) char s[50]; for (go through every element in the (s) array) if element else if element ) else if element operand else (element is operator (use isdigit function)) push on stack Loop: pop from stack and put in queue until (. Pop ( put in queue loop as long as precedence of element is equal or smaller than precedence of what is on top of the stack. Pop from stack and put in queue Push element on stack