Which of the following approaches makes the $($singly$)$ linked list$$based queue implementation the most efficient in running time?

In the enqueue operation, nodes are inserted at the end of the linked list. In the dequeue operation, nodes are removed from the end of the linked list.

In enqueue operation, nodes are inserted at the beginning of the linked list. In the dequeue operation, nodes are removed from the beginning of the linked list.

In the enqueue operation, nodes are inserted at the beginning of the linked list. In the dequeue operation, nodes are removed from the end of the linked list.

In enqueue operation, nodes are inserted at the end of the linked list. In the dequeue operation, nodes are removed from the beginning of the linked list.