Complete the following implementation of the push front(string s) method that inserts a node at the front of the doubly-linked-list-based deque shown below, where the front of the deque is at the head of the linked list. The data in each Node is a string stored in a variable named s class Deque public: void push front(string s); private: class Node public: string s, Node* next; Node* prev; Node* head; Node* tail; int count; void Deque push_front(string s) Node* p new Node; p->next = p->prev if (count = 0) { head tail ++count return p- next- p->next->prev' head-L ++count Complete the following implementation of the push front(string s) method that inserts a node at the front of the doubly-linked-list-based deque shown below, where the front of the deque is at the head of the linked list. The data in each Node is a string stored in a variable named s class Deque public: void push front(string s); private: class Node public: string s, Node* next; Node* prev; Node* head; Node* tail; int count; void Deque push_front(string s) Node* p new Node; p->next = p->prev if (count = 0) { head tail ++count return p- next- p->next->prev' head-L ++count