Convert psuedo code to C programming language /infix-to-postfix conversion algorithm

 the student should implement in C language the infix-to-postfix conversion algorithm given below:
Read input string to an empty buffer (we assume a valid string is provided)
Place a marker to the first symbol of the input
While marker is not pointing to the end of the input string, do (discard white-space characters, if exist)
If marker points to an operand, then
Place it to the output string
Else-if marker points to an opening parenthesis, then
Push it to the operator’s stack
Else-if marker points to an operator, then
If operator’s stack is empty, then
Push it to the operator’s stack
Else-if top of the operator’s stack is an opening parenthesis, then
Push it to the operator’s stack
Else-if operator has higher priority than operator at the top of the operator’s stack, then
Push it to the operator’s stack
Else
While operator’s stack is not empty and
top of the operator’s stack is not an opening parenthesis or is an operator that has same or higher priority, do
Pop an operator from the operator’s stack
Place it to the output string
End-while
Push operator to the operator’s stack
End-if
Else-if marker points to a closing parenthesis, then
While top of the operator’s stack is not an opening parenthesis, do
Pop an operator from the operator’s stack
Place it to the output string
End-while
Pop and discard the opening parenthesis
End-if
Advance marker to the next symbol
End-while
If operator’s stack is not empty, then
While operator’s stack is not empty, do
Pop an operator from the operator’s stack
Place it to the output string
End-while
End-if
Print output string
Note that you should translate the pseudocode one-to-one into C statements.