Design Circular Queue

Design and build a circular queue. This FIFO (First In, First Out) linear structure wraps its final slot around to its first slot, forming a loop. Implement the MyCircularQueue class: MyCircularQueue(k) Creates a queue whose capacity is k. boolean enQueue(int value) Adds value to the circular queue, returning true when the insertion succeeds. boolean deQueue() Removes the item at the front of the queue, returning true when removal succeeds. int Front() Returns the item…