a. void insertHead(doublyLinkedList *listPtr, int value);Insert a new node that has value given to the head of the list. Make sure you update the head pointer contained in the doublyLinkedList structure. If this node is inserted into an empty list, you should also update the tail pointer in thedoublyLinkedList structure.

b.int removeTail(doublyLinkedList *listPtr);Remove the tail node from the doubly linked list and return the value it contains from the function. Remember to update the tial pointer contained in thedoublyLinkedList structure. Make sure you use free to release the memory holding this node.

This is in C language. This has been provided:

typedef struct listNode{

int value;

struct listNode *next;

struct listNode *prev;

}listNode;

typedef struct doublyLinkedList{

listNode *head;

listNode *tail;

}doublyLinkedList