Suppose that we change the naive array-based implementation of a queuepictured in Figure 14-7 so that the back of the queue is in items[0]. Although repeatedremovals from the front would no longer cause rightward drift, what other problem wouldthis implementation cause?

What will be an ideal response?

Additions to the queue, which will be at its back, will require that all entries curently in the queue shift one array location toward the array’s end.