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?

A. Delete the tail node

B. Insert a node at the head

C. Delete the head node

D. Insert a node at the tail

question Question text Which of the following is FALSE about the linked list implementaion with sentinel nodes?

A. Using sentinel nodes makes the Delete method's code simpler.

B. Sentinel head does not store any list element.

C. Sentinel tail does not store any list element.

D. Sentinel tail is not needed when the list is empty.