Implement a Fixed-Capacity Deque

Design a fixed-capacity double-ended queue implemented over a circular buffer. The structure is created with a maximum size k, and every supported operation must run in $$O(1)$$ time. The required methods are: insertFront(value): places value at the front; returns true only if the deque had room. insertLast(value): places value at the back; returns true only if the deque had room. deleteFront(): removes the front element; returns true only if a removal occurred.…