Using Java programming,

Rewrite the ArrayQueue class so that, instead of a field size indicating the number of Objects in the queue, there is a field back indicating the next available position. How will you know when the queue is full? This code should also implement a sort of peek() method for the ArrayQueue

-----------------------------------------------------------------------------------------------------------------------------

public class ArrayQueue implements Queue { /** Array of items in this Queue. */ private E[] data; /** Index of the frontmost element in this Queue. */ private int front; /** Number of items currently in this Queue. */ private int size; /** The Queue is initially empty. */ public ArrayQueue() { data = (E[])(new Object[1]); // This causes a compiler warning size = 0; front = 0; } public void add(E target) { if (isFull()) { stretch(); } data[(front + size) % data.length] = target; size++; } public boolean isEmpty() { return size == 0; } /** Return true if data is full. */ protected boolean isFull() { return size == data.length; } public E remove() { if (isEmpty()) { throw new EmptyStructureException(); } E result = data[front]; front = (front + 1) % data.length; size--; return result; } /** Double the length of data. */ protected void stretch() { E[] newData = (E[])(new Object[data.length * 2]); // Warning for (int i = 0; i < data.length; i++) { newData[i] = data[(front + i) % data.length]; } data = newData; front = 0; } }