[2 pt] OWNP -- ht laid ATL CAX bed ILAX ATL (9) Assume a Deque instance is not empty nor full. The following function can be used in a Deque class with the target and name of: 1 def function(self, value): 2 if self._front == 0: 3 self._front = len(self._data) - 1 4 else: 5 self._front 1 6 self._data[self._front] = value 7 self._size += 1 D. add_last A. add_first B. delete_first C. delete_last (10) Related to the Singly Linked List, the number of the incorrect line in terms of its order in the following algorithm is: [2 pt] 1 def add first(Lst, element): 2 newest = Node(element) 3 Lst.head = newest 4 newest.next = Lst.head 5 Lst.size = Lst.size+1 A.5 B. 4 C. 3 D. 2 (11) In singly linked stack, there is no tail pointer because: [2 pt] A. You cannot have a tail pointer in singly linked list's structure. B. Tail pointer points to the same location as the head pointer. C. All operations are done at the head. D. Tail may lead to fatal errors. (12) An empty doubly linked list has: A. Two special nodes [2 pt] B. No nodes at all C. Only a trailer node D. Only a header node (13) A node in a doubly linked list has the following: A. Four references, 2 for next node and 2 previous node. [2 pt] B. Three references, to the previous & next nodes and to the element. C. Two references, to the header and to the trailer. D. One reference only to the element