Solve

A doubly linked list has pointers to both the next and prev element. Assume that doubly linked lists of String are implemented with the following Node class. class Node { String item; Node next; Node prev; Suppose that p and q refer to adjacent nodes in the middle of a doubly linked list, as shown: A code segment that removes both of these nodes from the list is: I p.prev.next = q.next; q.next.prev = p.prev; ll p.next = q.next; q.prev = p.prev