You task is to complete the function findIntersection() which takes the heads of the 2 input linked lists as parameter and returns the head of intersection list. Returned list will be automatically printed by driver code. Note: The order of nodes in this list should be same as the order in which those particular nodes appear in input list 1.
1 <= n,m <= 103
Expected time complexity: O(m+n) Expected auxiliary space: O(m+n)