[Java][Data Structures] Which of the following is true for the above piece of code regarding LinkedLists?

Assume that L has at least 2 elements*/ Node n = L.head; while (n.getNext0! null) n-n.getNext0; System.out.println(n.getltem0); while (n.getPrecede)!-null) n-n.getPrecede0; System.out.println(n.getltem(); Which of the following is true for the above piece of code? 1. it will print all the items in the Doubly Linkedlist 2. it will print all the items in the Doubly Linkedlist in reverse order 3. It will print the Last item 4. it will print the first item 3 and 4 1 and 2 1 and 4 2 and 3 1 and 3 2 and 4 Which line of the following code for adding a new item to the front of a doubly linked list is erroneous? The signature of the constructor used in the code is Node (E ltem, Node PrevNode, Node NextNode) 1: public void addFirst(E element) 2: Node tmp-new Node (element, null, head); 3: if (head-null) 4: 5 head tmp: head.setNext(tmp); -A 0 2 none Node n head; do System.out.printin(n.getltem0) n n. getNext0; } while (n.getNext0!=null); Which of the following is true for the above piece of code? 1. It will print all the items in the Linkedlist 2. It will not print the Last item 3. It will not print the first item 4. It will not work if head is null 2 and 4 3 and 4 1 and 4 2, 3 and4 2 and 3 Consider the following linear doubly-linked list where the variable head points to the first node of the list: head-> 3 8 9 11 1 132 74 What value is retrieved by head.getNext.getNext.getPrev..getNext.getitem07 1