A queue is a "first in first out" data structure. Inserting elements is called 'enqueuing'.
Removing/deleting elements from a queue is called 'dequeueing'.
If you enqueue (insert) elements in this order, then when you call dequeue, the
first element removed is . The second element would be and so on.
Each input line will look like one of the following:
where is a number that will fit inside int on the server.
Maintain a queue of elements. Enqueue elements when input starts with "E". Dequeue when
the input line is "D".
If the input line said "E ", then enqueue (insert) the number into . No output!
If the input line said "D", then dequeue from and print the number that was dequeued.
If a dequeue was requested on an empty queue, print "Empty".
Terminate all your output lines with \n .
You must use a struct to maintain your queue.
Use convenient typedef(s).
Create supporting functions.
Although in practice, you would create separate header file(s), we require you to put everything
into just one .c file so that our evaluation server can be used.