Question 2 (3 points) Given the following singly linked list (a list with four nodes), what…

Question 2 (3 points) Given the following singly linked list (a list with four nodes), what will be the value stored at the last node when the following operations are executed? head->1111-151->11011->1211 Node curr = head; while(curr next !=null) { curr.item = curritem-head. item; curr = cur next; ____ Node newNode = new Node(8): curr.next = newNode: 23 O 12 OS O21 Question 3 (3 points) Given a recursive method as shown below, what is the return value for P(5) public static int P(int al 11 (n — 1) return 2, else 12 — 2) return 3; ela return PIA – 1) – Pin – 2); 13 11 O 10 Question 4 (3 points) Given a singly linked list with more than two nodes, to remove the second node from a linked list with only head reference, assume curr = head next, you do set head next to curr.next Set curr. next to head. next set head to CMIT. NEXT Set head. next to CHIT