Circular Queue Implementation

Function Name: CircularQueue

Description

Implement a Circular Queue using an array. The Circular Queue should support the following operations: enqueue, dequeue, peek, and isEmpty. The enqueue operation adds an item to the back of the queue, the dequeue operation removes an item from the front of the queue, and the peek operation retrieves the item at the front of the queue without removing it. The isEmpty operation should return a boolean indicating whether the queue is empty. The Circular Queue should also have a fixed size specified at the time of creation and should handle the wrap-around when the end of the array is reached.

Requirements

• The CircularQueue class must have a constructor that takes a fixed size as an argument.
• Implement the enqueue operation, which should add an item to the queue if there is space available.
• Implement the dequeue operation, which should remove an item from the front of the queue and return it.
• Implement the peek operation which returns the item at the front of the queue without removing it.
• The isEmpty operation should return a boolean indicating whether the queue is empty.
• Enqueue should not add an item to the queue if the queue is full; it should return an error message or status instead.
• Dequeue on an empty queue should return an error message or status.
• Handle the corner case where enqueue should add to the beginning of the array when the end is reached and there is space available at the beginning (the wrap-around functionality).

Examples

const queue = new CircularQueue(3);queue.enqueue(1); // truequeue.enqueue(2); // truequeue.enqueue(3); // truequeue.enqueue(4); // Error: Queue is fullqueue.peek(); // returns 1queue.dequeue(); // returns 1queue.isEmpty(); // returns falsequeue.dequeue(); // returns 2queue.dequeue(); // returns 3queue.isEmpty(); // returns truequeue.dequeue(); // Error: Queue is emptyqueue.enqueue(5); // true, starts from the beginning