must be a running code using java. thanks!

Problem-2 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. List may have n nodes before it reaches intersection point and List might have m nodes before it reaches intersection point where mand n may be man, m> norm norm<.><.>