<prompt> Kwa kuwa vichwa vya orodha mbili zilizounganishwa moja kwa moja headA na headB, kurudi node ambapo orodha mbili zinakutana. Ikiwa orodha mbili zilizounganishwa hazina makutano hata kidogo, kurudi null. Andika suluhisho katika C .  <response>: Heres the solution in C:ListNode getIntersectionNodeListNode headA, ListNode headB ListNode p1 headA; ListNode p2 headB; while p1 ! p2 p1 p1 ? p1-next : headB; p2 p2 ? p2-next : headA; return p1;We traverse both lists simultaneously until we find a common node or we reach the end of both lists. When one of the pointers reaches the end of a list, we point it to the head of the other list, so that it can traverse the other list. 