Please help in Java!!

array is not considered circular, the text suggests that each remove 2. If an 0eration must shift down every remainingelement of a queue. An alternative entire queue is shifted down so that the first element of the queue is in the ming a shift at each remove operation? What are the disadvantages? thod is to postpone shifting until rear equals the last index of the array. When situation occurs and an attempt is made to insert an element into the queue, met first position of the array. What are the advantages of this method over perfo