First Last *next data *prev "next data *prev *next data *prev Figure1:Cyclicdoulbelinkedlist // Cyclic double linked list void insert cyclic doublelist(cdlist *lp, int t) { //put your code here Given the following declarations: WA typedef struct calist tag { int data; struct typedef struct { cdlist tag * next; struct cdlist tag CDListNode first; prev; CDListNode * last; } CDListNode; } cdlist; and the functions for inserting an element in a double linked list and a cyclic linked list: First Last First Last next next data *next prev data data prey prev data next data next data next // Double linked list void dlistInsert/dlist *lp, int t) { DListNode * n = malloc(sizeof( DListNode)); n->data = t; // Cyclic linked list void clistInsert(clist *lp, int t) { ListNode *n = malloc(sizeofl ListNode)); n->data = t; if (Up->first == NULL) { n->pcex = n->next = NULL; JR->first = !r->last En: } else { n->Rrex = lr->last; n->next = NULL; LR- >last->next = n; lr->last = 0; } if (Up->first == NULL) { Je->first = le->last = n; n->next = 0; } else { n->next = 1R->first; JR->last->next = n; 1R->last = n; } } complete the function insert cyclic double list which inserts an element in a cyclic double linked list