Consider an implementation of unsorted singly linked list. Suppose it has its representation with 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 listii) Insertion at the end of the linked listiii) Deletion of the front node of the linked listiv) Deletion of the last node of the linked listOptionsI, II and IVI and III and IIII, II and III

What is the time complexity to insert an element to the rear of a LinkedList(head pointer given)?*2 pointsO(n)O(1)O(log(n))None of the above

In a doubly linked list, the number of pointers affected for an insertion operation will be

Which operation is not supported by a doubly linked list?Insertion at the beginning of the list.Deletion from the middle of the list.Accessing elements randomly by index.Traversing from the end of the list to the beginning.

Which of the following operations is the most efficient in a doubly linked list compared to a singly linked list?You Answered  Traversing the list   Accessing an element by index Correct answer  Deletion of the last node   Insertion at the beginning

Which of the following operations is not possible in a doubly linked list?Insertion at the beginningInsertion at the endDeletion from the middleDirect access to an element by index