Page 119, Exericse 3

If we start with a full queue, remove an item from the front, and shift the remaining items downward by one array position, it will take O(MAX_QUEUE_SIZE) for each delete operation. If we immediately and repeatedly, add one item to the rear of the queue and remove the item at the front, each add/delete combination will take O(MAX_QUEUE_SIZE) .