If We Want a Create a Doubly-Linked List Data Structure

Multiple Choice

If we want a create a doubly-linked list data structure so that we can move from a node to the next node as well as to a previous node, we need to add a previous reference to the Node class.Each such DNode (doubly-linked Node) will have a data portion and two DNode references, next and previous.How many references need to be updated when we remove a node from the middle of such a list? Consider the neighboring nodes.

A) 1
B) 2
C) 3
D) 4