using java oop, Task $2$: Implement a Circular Queue

Implement a circular queue data structure using arrays in Java. Include the following operations:

enqueue$($item$)$: Adds an item to the rear of the queue.

dequeue$()$: Removes and returns the item from the front of the queue.

peek$()$: Returns the item from the front of the queue without removing it$.$

isEmpty$()$: Returns true if the queue is empty, false otherwise.

isFull$()$: Returns true if the queue is full, false otherwise.