The following method is added to our DLinkedList class. What is the purpose of this mystery () method? def mystery(self): if self.size < 3 : raise Exception("List too small!") temp = self.tail temp.setNext(self.head) self.head. setPrevious(temp) self.tail = temp.getPrevious() self.tail.setNext(None) temp.setPrevious(None) self.head = temp Select one: Reverse the order of all nodes in the linked list. Move the first node to the tail of the list. Move the last node to the head of the list. Swap the head and the tail nodes, so that the last cross out node becomes the first node and the first node becomes the last node..