Implement a queue that can hold at most capacity items and run the given operations. "enqueue" adds args[i] and reports 1, or reports 0 if the queue is full; "dequeue" removes and reports the front item (−1 if empty); "front" reports the front item (−1 if empty); "isEmpty" and "isFull" report 1 or 0. Return all reported values in order. A circular queueCircular Queue (Ring Buffer)A fixed-size queue stored in an array whose indexes wrap around from the end back to 0, so freed slots are reused. solves the wasted-space problem of a simple array queue: when the back reaches the end of the array, it wraps around to the slots freed at the front. The moduloModulo WraparoundUsing % capacity so an index that passes the end of the array continues from 0. operator does the wrapping, giving O(1) operations with no shifting and no wasted space.