assume you are using a doubly-linked list data structure with many nodes. what is the minimum number of node references that are required to be modified to remove a node from the middle of the list? consider the neighboring nodes.