Why is a circular doubly linked list with a dummy head node the best implementation of a linked list? Explain your answer

Question $11$ options:

Inserting a dummy head node into a linked list makes it easier to add to the beginning of the list. Changing the first node of a linked list will also make us change the pointer of the linked list. Having a dummy head that never changes avoids this.

A dummy circular head node is just one node with a reference to itself as the current and future nodes, so the time to get to it would be non$-$existent, or O$(1).$

The list can be traversed in either direction $-$ a circle has no beginning or end. This means that I don't need external curr, prev, and next pointers to accomplish anything. One external pointer is all that is needed.

Because it doesn't point to null and that may cause a problem, rather it points to first element in the array