I need a C program using queues to answer the following problem...

One way to evaluate a prefix expression is to use a queue. To evaluate the expression, scan it repeatedly until the final expression value is known. In each scan, read the tokens and store them in a queue.

In each scan, replace an operator followed by two operands by the calculated values. For example, the following expression is a prefix expression, which is evaluated to 159. - + * 9 + 2 8 * + 4 8 6 3 We scan the expression and score it in a queue. During the scan, when an operator is followed by two operands, such as + 2 8, we put the result, 10 in the queue. After the first scan, we have

- + * 9 10 * 12 6 3

After the second scan, we have - + 90 72 3 After the third scan, we have - 162 3

After the fourth scan, we have

159