In a doubly linked list, how does the insertion operation at the front differ from that in a singly linked list?

It requires updating two pointers instead of one.

It requires traversing the entire list.

It is slower due to bidirectional traversal.

It is faster due to constant$-$time access to the tail.