1. How many pointers are contained in the nodes of a circularly doubly-linked list with a sentinel node of five data nodes?

2.given a circularly doubly-linked list with a sentinel node where each node has two references(forw and back); one that points to the next node and another that points to the previous node. Assume the linked list below:

SENTINEL - 30 - 70 - 90 - 50 - 10

Provide the output for the following statement

Print( head->forw->forw->forw->forw->back->data)

3.given a circularly doubly-linked list with a sentinel node where each node has two references(forw and back); one that points to the next node and another that points to the previous node. Assume the linked list below:

SENTINEL - 30 - 70 - 90 - 50 - 10

provide the output for the following pseudocode

ptr = head->forw->forw

ptr->back->forw=ptr->forw

ptr->forw->back=ptr->back

list.printForw()//lprints the list forward.

4.given a circularly doubly-linked list with a sentinel node where each node has two references(forw and back); one that points to the next node and another that points to the previous node. Assume the linked list below:

SENTINEL - 30 - 70 - 90 - 50 - 10

provide the output for the following pseudocode

head->forw->data+=head->back->data

list.printBack()//lprints the list backward.

Answer should only be numbers