java

Question 10 (1 point) A circular linked list is a variation of a linked list in which the first element points to the last element and the last element points to the first element. Both a singly linked list and a doubly linked list can be made into a circular linked list. Consider an implementation of a circular doubly linked list and assume that the following method has been implemented in such a class: public static void mystery (DNode nodei, DNode node2) { node1.next.prev = node2; node2.next.prev = nodel; DNode temp = nodel.next; nodel.next = node2.next; node2.next = temp; } Which of the following is true about the method above? Select all correct answers. a) Assuming node1 and node2 belong to two different lists, then both lists will end up containing all of the elements. HE Which of the following is true about the method above? Select all correct answers. a) Assuming node1 and node2 belong to two different lists, then both lists will end up containing all of the elements. b) A NullPointerException will be raised if either node1 or node2 belongs to a list that contains only one element. c) Assuming node1 and node2 belong to two different lists, then the two nodes are swapped. d) Assuming node1 and node2 belong to the same list, then all elements between two will be removed from the list (including one of the two stored in the input nodes). e) Assuming node1 and node2 belong to the same list, then the two nodes are swapped