2. Queues The following Java class implements queues using "circular" arrays. Each queue maximum capacity given by the size of the array storing the queue items. public class ArrQueuef private int capacity; private IntegerD items; private int front-o; private int back-o; public ArrQueue(int cap)f items new public ArrQueue ) ( Integer [capl, capacity cap; //creates an empty queue items new Integer [100]; capacity 100: //creates an empty queue public boolean isEmptyOf... public boolean isFullof... public int getSizeOt.//returns the number of elements in the queue public void enqueue (Integer i) throws FullQueueException t... public Integer dequeue0 throws EmptyQueueException C... (a) (8) Consider a queue with capacity 5. The queue is initially empty. Draw a sketch of the q er each queue operation in the followingequence enqueue(3), enqueue(7) enqueue(8) dequeue(), dequeue ), enqueue (10), dequeue(), enqueue (6), enqueue (2). Show the values of variables front and back as well