Can you help me with this java question

Question 9 (1 point) Which block of code would remove the last node from a linked list? Assume that head refers to the beginning of the list. Assume that there are lots of nodes in the list. while (head.next.next !- null)( head head.next; head.next = null; Node current head; while (current.next != null){ current current.next; current.next = null; head head.next; Node current head; while (current.next.next != null){ current - current.next; current.next = null