ProblemThis challenge is part of a tutorial track by MyCodeSchoolGiven pointers to the heads of two sorted linked lists, merge them into a single, sorted linked list. Either head pointer may be null meaning that the corresponding list is empty. ExampleHeadA refers to 1 → 3 → 7 → NULLheadB refers to 1 → 2 → NULLThe new list is 1 → 1 → 2 → 3 → 7 → NULL Function DescriptionComplete the mergeLists f..