For the double-linked list in the figure below, explain the effect of each statement in the following fragments. MAKE SURE TO STATE THE FINALE RESULT OF EACH FRAGMENT. Each fragment should be treated independently.

a)

DNode* node_ptr = tail->prev;

node_ptr->prev->next = tail;

tail->prev = node_ptr->prev;

b)

DNode* node_ptr = head;

head = new DNode("Tamika");

head->next = node_ptr;

node_ptr->prev = head;

c)

DNode* node_ptr= new DNode(Adam);

tail->prev->next=node_ptr;

node_ptr->prev=tail->prev;

tail=node_ptr;

DNode DNode DNode DNode DNode next = next = prey = data="Tom" prev = data="John" next = prev = data="Harry" next = prey = data="Sharon" next = prev = data="Sam" DNode DNode DNode DNode DNode next = next = prey = data="Tom" prev = data="John" next = prev = data="Harry" next = prey = data="Sharon" next = prev = data="Sam