Which<br/>of the following operations is performed more efficiently by doubly<br/>linked list than by linear linked list? () A: Deleting<br/>a node whose location is given B: Searching<br/>an unsorted list for a given item C: Inserting<br/>a node after the node with a given location D: Traversing<br/>the list to process each node

Consider an implementation of unsorted singly linked list. Suppose it has representation which a head pointer only. Given the representation, which of the following operation can be implemented in O(1) time?(I). Insertion at the front of the linked list.(II). Insertion at the end of the linked list.(III). Deletion of the front node of the linked list.(IV). Deletion of the last node of the linked list. A: I, II, and IV B: I and II C: I, II, and III D: I and III