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$).$

Consider the following method for removing a node from a linked list:

$//$ Precondition: ie assume that this holds when the method is called. p points to a node in a nonempty linked list.

$//$ Postcondition: ie$.$ we want to guarantee that this holds when the method ends. The node that p points to has been removed from the list.

public void remove $($ListNode p$)\{$

ListNode q $=$ p$.$next;

p$.$item $=$ q$.$item;

p$.$next $=$ q$.$next;

$\}$

In which of the following cases will the remove method fail to work as intended?

I p points to any node in the list other than the first or last node.

II p points to the last node in the list.

III p points to the first node, and there is more than one node in the list.

Question $3$ options:

I and III only

II and III only

III only

II only

I only

I and II only