Problem 1. Suppose that there are two stacks. Make a queue using them.
Example input: A string where a letter means enqueue and an asterisk means dequeue in the sequence EAS*Y*QUE***S T***IO*N***.
Output: Give the sequence of values returned by the dequeue operations. Assume an empty FIFO queue initially.
이거 c언어로 어떻게 구현할 수 있을까요..?