Can this be done in C++

QUESTION 3 (25 points) A "Double-Ended Queue"or "Deque" (say "deck") is an Abstract Data Type with the following operations (not intended to be real C - just pseudo-c): pushfront (DEQUE q, int x) // adds to front of sequence int pop_front (DEQUE q) push back (DEQUE q, int x) // adds to end of sequence int pop_back (DEQUE q) // removes first element // removes last element So it's a sequence of integers where you can add and remove from either end. You plan a linked list implementation and have several implementation possibilities Singly Linked (SLL) Doubly Linked (DLL) Front (Head) Pointer Only or or Front Pointer and Back (Tail) Pointer. This yields a total of 4 implementation possibilities: SLL-Head SLL-Head-Tail DLL-Head DLL-Head-Tail Part I (8 points) For each option, give the best achievable runtime for each of the operations in the table below SLL-Head SLL-Head-Tail |DLL-Head DLL-Head-Tail push front pop_front push back pop back