Given Singly Linked List SLL that only keeps a reference to the first node of the list, called the head, each node in the singly Linked List stores an element and a link to the next node. Which statements are TRUE for operations in a singly linked list?

You can always remove the last element of the list in constant O$(1)$ time.

Inserting a new node after a given node can be done in O$(1)$ time.

You must traverse the list from the head to insert a new node before a given node.

Question $2$Select one:

II only.

I and II$.$

none of them is correct

I only.

I and III.

III only.

II and III.

I, II and III.