Design Circular Queue

Design a circular queue of fixed capacity k backed by a single array of size k. The last position connects back to the first, so freed slots at the front are reused.

Implement the MyCircularQueue class:

• MyCircularQueue(k) sets the capacity.
• enQueue(value) adds at the rear; returns true on success, false if the queue is full.
• deQueue() removes from the front; returns true on success, false if the queue is empty.
• Front() returns the front value, or -1 if empty.
• Rear() returns the rear value (the most recently added still in the queue), or -1 if empty.
• isEmpty() and isFull() report the state.

Every operation is O(1). Do not use a resizable list as the queue itself.