Written in Java. Thanks in advance!

Problem-1 Check whether a linked list is either NULL-terminated or ends in a cycle (cyclic) Hints: 1. Allocate two pointers 2. Initiate both of them as head 3. One will be twice faster than other 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 not known. 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 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