When you write a program using an abstract data structure you can complete the d

When you write a program using an abstract data structure you can complete the design of the program before you determine the actual implementation of the data structure. If you design the interfaces carefully you should be able to change the way you implement the data structure without affecting the outcome of the program. In this Application you will write alternative pseudocode implementations of a queue.A queue is a first-in first-out list. The queue has two essential operations: enqueue which appends an entry to the end of the list (called thetail) and dequeue which returns and removes the first entry in the list (called thehead). The queue returns entries in the sequence in which they were added. When you do this in real life you may refer to it as standing in line. Some queue implementations include auxiliary operations that may allow programmers to write simpler code.