It is C++. Data structure. For "deque"

Thank you so much

For this assignment you create your own version of a double-ended queue, known as a "deque". Base your implementation using a doubly-linked list, a circular linked list, or a combination of the two, a doubly- circular linked list. Up to you. Submit your solution in a single header file named MylntDeque.h. Do not submit screenshots. Do not submit a driver progrm. Submit only the header file Use the following UML diagram and attribute description for your implementation. MylntDeque Node value: int next Node Node* first: Node -last Node +MylntDeque0 -MylntDequeo push back(i: int)xvoid +push front(i intvoid +pop back(void pop front(): void +size(): int front(): int +back): int isFull bool isEmpty( bool +clear): void