Link Lists (C PROGRAM) Let x = (x1, x2, …, xn) and y = (y1, y2, …, yn) be two linked lists.  Write an algorithm to merge the two lists together to obtain a linked list z = (x1, y1, x2, y2, …, xm, ym, xm+1, …, xn) if m ≤ n and z = (x1, y1, x2, y2, …, xn, yn, yn+1, …, ym) if m > n.  No additional nodes may be used.

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.…

Linked List Write a DETAILED algorithm length to count the number of nodes in a singly linked list p, where p points to the first node in the list. The last node has link field NULL. Assume that each node has two fields: data and link. Account for the range of all possible linked list lengths. Needs to be in detailed and code in C PROGRAM would be helpful!

Please explain, C-prog   What is a NULL Terminator?   Is it correct answer below, please explain   A. Essentially '0'. Typically used to end strings, or indicate the end of a linked list.