notes review questions write program to sort the elements of linked list why are linked list better than arrayscompare giving examples create linked list and write programs to(ainsert node at the nth position where is accepted as an input from the keyboard (bdelete node from the nth position where is accepted as an input from the keyboard (cshift the node at the nth position to the position where and are accepted as inputs from the keyboard write program for building of an element of the circular linked list describe the method of inserting node using recursive program write program to merge two given lists and to form in the following mannerthe first element of is the first element of and the second element of is the first element of the second elements of and become the third and fourth elements of cand so on if either or gets exhaustedthe remaining elements of the other are to be copied to write program to transform circular list into chain describe adt of singly linked lists write remove for the (secondimplementation of simply linked lists that remembers the last-used position prepare collection of files containing the declarations for contiguous list and all the functions for list processing answersself assessment ( ( ( ( dynamic an element of the lista link or address of another node insert linked list false false false further readings books brian kernighan and dennis ritchiethe programming languageprentice hall data structures and algorithmsshi-kuo changworld scientific lovely professional university