Consider the unbounded queue implementation shown in Fig.10.22.This queue is blocking, meaning that the deq()method does not return until it has found an item to dequeue. T he queue has two fields:...

Consider the unbounded queue implementation shown in Fig.10.22.This queue is blocking, meaning that the deq()method does not return until it has found an item to dequeue. T he queue has two fields: items is a very large array, and tail is the index of thenext unused element in the array