Merge Number Chains

Problem Statement

Merge Number Chains Problem Description Tom and Bob love to play with Number chains. Both of them got their own Number chains which consist of numbers. One day Tom got a crazy idea to merge one of his Number chain with Bob's Number chain and challenged Bob to identify the merging point of the two chains with blind folds and add the smaller chain before the merge point at the end of larger chain. Bob being a tech enthusiast accepted the challenge and decided to find the merging point and add the smaller chain to the larger chain, but he can't see anything due to the blind fold. Can you help Bob to find the merging point of two number chains and append the smaller chain to the larger chain? Given the function Node findchain(Node Chain1, Node Chain2) , where Chain1 and Chain2 are two linked lists of integers. The function should return a single linked list such that it contains the smaller chain before the merge point appended to the larger chain as described in examples. If both chains a