in C urgent!!!

Use the attached code below. In this lab exam, you are going to implement mergeLists function. This function aims to merge 2 sorted lists. Assume that input lists to mergelists is sorted. You are going to u input.txt as input to the program. Example: When list1 >1 34679 and list2->245 the output merged list will be list3->123445679. In this program, allocation is done in a smart fashion, and count of memory allocated is kept track. And in the implementation of the function mergelists, you must use already allocated memory and you are not going to allocate any extra memory. Hence: list1->134 479 and list 245 at the end of first iteration, it will be list1->34679, list2->245, list3->1 You will change the pointers, and do not need to allocate extra memory. Since you are always inserting to the end of list3, you can keep track of a temporary pointer as tail to ease insert at the end of the list, and not to traverse list 3 till the end at each insert. At the end of the program, ensure that Allocated memory is 0