Consider a linked list constructed using a Node class as we have used in class, with fields item and next. Assume that first is accessible and references the first node in the list, that the list is nonempty, and that it is null-terminated (that is, the last node in the list has its next field set to null). The following segment is supposed to search for and remove from a list all nodes whose data fields are equal to val, a previously defined value. ListNode cursor = first; while (cursor != null) { if (cursor.item.equals (val)) { ListNode q = cursor.next; cursor.next = q.next; } else { cursor = cursor.next; } } Which is true about this code segment? It fails for only the last node of the list. It fails for the first and last nodes of the list but works for all others It works for all the nodes of the linkedillist