1. Consider a queue implementation that uses the ADT list to represent the items in the queue. Discuss the effi ciency of the queue’s insertion and removal operations when the ADT list’s...

1. Consider a queue implementation that uses the ADT list to represent the items in the queue. Discuss the effi ciency of the queue’s insertion and removal operations when the ADT list’s implementation is a. Array based b. Link based

2. An operation that displays the contents of a queue can be useful during program debugging. Add a display operation to the ADT queue such that display uses only ADT queue operations, so it is independent of the queue’s implementation.