Consider the following two linked list implementations:

Option $1.$ Singly linked list, keeping track of head and tail

Option $2.$ Doubly linked list, keeping track of head and tail

For which of the following operations, Option $2$ can be significantly faster than Option $1?$

Question $3$ Answer

A$.$

Insert a node at the head

B$.$

Delete the head node

C$.$

Delete the tail node

D$.$

Insert a node at the tail