Which of the following operations can be performed more efficiently with a doubly linked list than with a singly linked list?A$)$ Insertion at the beginningB$)$ Deletion of a node when given a reference to that nodeC$)$ Traversal of the listD$)$ Searching for a node