Circular Queue Implementation

Function Name: CircularQueue

Description

Create a CircularQueue class that represents a circular queue for integers with a fixed size.

It should support enqueue (add an item), dequeue (remove and return an item), and isEmpty methods.

Additionally, the CircularQueue class should have a method to return the current size of the queue.

Requirements

• The CircularQueue class should have a constructor that takes an integer indicating the maximum size of the queue.
• The enqueue method should add an element to the back of the queue if the queue has not reached its maximum size. If the queue is full, it should return 'Queue is full'.
• The dequeue method should remove the element at the front of the queue and return it. If the queue is empty, it should return 'Queue is empty'.
• The isEmpty method should return true if the queue is empty, false otherwise.
• The size method should return the number of elements currently in the queue.
• You should not use any built-in queue data structures.
• Think about how you will handle the circular aspect; when an item is dequeued, the space it occupied can be used to enqueue new items.

Examples

let cq = new CircularQueue(3);cq.enqueue(1); // returns nothingcq.enqueue(2); // returns nothingcq.size(); // returns 2cq.enqueue(3); // returns nothingcq.enqueue(4); // returns 'Queue is full'cq.dequeue(); // returns 1cq.enqueue(4); // returns nothingcq.size(); // returns 3