Which of the following is similar about singly and doubly linked list?*2 pointsBoth of them are not able to access the data at a random position in constantBoth of them can add a new node after given node or at the beginning of the list in O(1) timeBoth of them can delete the first node in O(1) time.All of the above

Which of the following statements is true regarding a singly linked list?Group of answer choicesSingly linked lists are more efficient for random access operations.Singly linked lists can be traversed in both forward and reverse directionsSingly linked lists require less memory than doubly linked lists.Singly linked lists provide constant-time insertion and deletion at any position.

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.

What additional operations can be performed on a Doubly Linked List compared to a Singly Linked List?a)Deleting at the end only.b)Searching for an element.c)Traversing in both directions.d)Inserting at the beginning only

Which of the following is true for a doubly linked list compared to a singly linked list?It consumes less memory.It allows traversal in both forward and backward directions.It does not use pointers.It has faster insertion and deletion at the end.

Which of the following is false about a doubly linked list?Select one:a.We can navigate in both the directionsb.It requires more space than a singly linked listc.The insertion and deletion of a node take a bit longerd.Implementing a doubly linked list is easier than singly linked list