Chapter 18, Problem 7RQE

Explanation of Solution

FIFO:

• FIFO stands for “First In First Out”.
• The item which is inserted first, will be retrieved first.
• The example for FIFO implementation is “queue”. A queue can perform two operations. They are:

Enqueue:

Insertion of an element into the queue is called as Enqueue. The elements can be inserted at any end of the queue...