Write a rudimentary link program to check whether all variables have been initialized and whether local variables have the same names as global variables. Create a linked list of global variables, and for each function, create a linked list of local variables. In both lists, store information on the first initialization of each variable and check if any initialization has been made before a variable is used for the first time. Also, compare both lists to detect possible matches and issue a warning if a match is found. The list of local variables is removed after the processing of one function is finished and created anew when a new function is encounter. Consider the possibility of maintaining alphabetical order on both lists. Use a java program only.

Suppose there are two singly linked lists both of which intersect at some point and become a single linked list. The head or start pointers of both the lists are known, but the intersecting node is unknown. Also, the number of nodes in each of the list before they intersect are unknown and both the list may have it different.  List1 may have  n nodes before it reaches intersection point and  List2 might have  m nodes before it reaches intersection point where  m and  n may be  m =  n,  m >  n or  m <  n. Give an algorithm for finding the merging point.   Hints: A brute force approach would be to compare every pointer in one list with every pointer in another list.  But in this case the complexity would be O(mn)

You are to work to develop a linked-list processing function IsolateTargetSoloAsTail that is to process a linked list as follows.   ● If target cannot be found on the given list, a new node containing target is created and added to the end (made the new tail node) of the list.     ► This includes the case where the given list is empty, in which case the new tail node added is also new head node. (This is so because the only node in a 1-node list is both the head and tail node of the list.)   ● If target appears only once on the given list, the target-matching node is moved to the end (made the new tail node) of the list.     ► In case the target-matching node is already the tail node (of the given list), then nothing needs to be done.   ● If target appears multiple times on the given list, the first target-matching node is moved to the end (made the new tail node) of the list, and all other target-matching nodes are to be deleted from the list.     ►…