Design a Circular Queue data structure that supports the following operations: enQueue(value) – Insert an element into the circular queue. deQueue() – Delete an element from the circular queue. Front( ...

Implements a circular queue using a dynamically resizable array. The queue automatically expands its capacity when it becomes full and shrinks when a significant portion of its capacity is unused.