Which of the following is not a limitation of binary search algorithm? (a) Must use a sorted array. (b) There should be the direct access to the middle element in any sub list There must be mechanism to delete and/or insert elements in list. (d) Nose of above

thank u.

Using Dyanmic LL write a C++ program to do the following: Create a Dynamic LL Add anode: a) When the List is empty b) In the beginning of the List c)  In the end of the List d)  Somewhere between the beginning and the end of the List. e) Purge the LL   The ADD algorithm is to determine where the new node to be placed in the List. The user is not be asked where the new node should be inserted.   Delete a node: a)    When the List is empty b)    From the beginning of the List c)    From the end of the List d)    From somewhere between the beginning and the end of the List.   The DELTE algorithm is to determine where the targeted node is placed in the List. The user is not be asked about the location of the targeted node.   Search for a node and display its contents. The Search is done based on a key field from the node (i.e a name, or an ID) The Search algorithm is to locate the targeted node and to display it   The user is not be asked about the location of the targeted node.…

Write algorithms with illustration to i) Insert a node as a head in a Doubly Linked List. ii) Insert a node at an arbitrary location in Doubly Linked List. iii)     Delete a node from the head of Doubly Linked List. iv) Delete a node from arbitrary location in Doubly Linked List.