Refer to the lecture slides about dou ble linked lists and work on the following tasks a) Write a C program to implement the basic operations of Double Linked List data structure. Declare and initialize (initNode()) the double linked list to add integer 22 as first data in the list. Guides for declaration and initialization struct Node [ int data; Node next; Node prev; tmpHead->datani tmpHead->next-NULL tmpHead->prev=NULL; b) Implement the following operations as functions i) Display all nodes in the entire list -displayNodes() ii) Add two new nodes (33 and 44) to existing list (at the end) addNode() Guides for displaying all nodes and adding new node. Node *cur = tmpHead; while (cur != NULL) { Node newNode = new Node ; newNode->data = n; newNode->next = NULL ; cout data next ! NU cout next cur->next = newNode; newNode->prev = cur; c) Implement the following operations as functions i) Add a new node (11) to the front of the list-addFront() ii) Remove a node from the list (in front)- removeFront) Guides for adding new node in front and removing the first node Node newNode = new Node ; newNode->data = n; newNode->next = tmpHead; newNode->prev = NULL; *tmpHead = newNode ; newNode->next->prev = newNode; if ( (*tmpHead)->next != NULL){ (*tmpHead) = (*tmpHead)->next; delete tmpHead)->prev; (*tmpHead)->prev = NULL; else cout