Stacks, Lists, and Generics

Consider implementing a Deque ADT which supports enqueuing and dequeuing at both the front and back. From a Big$-$Oh efficiency perspective, would a singly or doubly linked list implementation have the most potential to be faster? Explain.

Singly $-$ the operations will require more code, but it will be a constant time of additional work which disappears with Big$-$Oh$.$

Singly $-$ the overhead of the doubly linked list has no purpose for these operations.

Doubly $-$ it will provide a backup of the next reference so that bugs don't require additional looping through the list.

Doubly $-$ reference in both directions will enable the operations to be implemented in constant time.