Given a representation of a singly linked list, oriented with head identifying the node at the "front" of the list and tail identifying the node at the "back" of the list, which of the following operations cannot be implemented without use of a loop?

Question $13$ options:

Delete the node from the front of the list

Insert a new node at the back of the list

Insert a new node at the front of the list

Delete the node from the back of the list