java pls

Design and implement a circular array-based queue based on the method in the lectures. Implement the following operations: enqueue, dequeue, front, size, isEmpty, and is Full. Make sure that your program checks when the queue is full in the enqueue operation, and when the queue is empty in the dequeue operation. Test your implementation. We spend a lot of time waiting in lines. Poor management of queues (waiting lines) can result in delays in service, customer dissatisfaction and loss of business. Queuing Theory studies how to operate a queuing system in the most effective way to balance the cost of providing service (e.g., number of servers) with the time customers must spend waiting in line. So, let's study this a little bit with a simple simulation. Can we do even better? Circular array based Yes... Implement A circular queue, or a "circular" array. We will have two configurations... Normal configuration: front back -1 32 -7 9 5 16 0 1 2 3 4 5 6 7 8 9 back front Circular Queue: IsEmpty, IsFull, Count, Enqueue, Dequeue IsEmpty : true when front back IsFull : true when (back + 1) mod N == front // where N is size of the array Count: (back - front + N) mod N // number of items in queue Enqueue value : if IsFull then handle error else A[back] = value; back+ (back + 1) mod N Dequeue : if IsEmpty then handle error else value A[front] front (front + 1) mod N return value