notes th( logmnis lower bound for the problem of external-memory sorting that ismultiway merge sort is an asymptotically optimal algorithm merging of two sorted lists assume that two lists to be merged are sorted in descending order compare the first element of the first list with the first element of the second list if the element of the first list is greaterthen place it in the resultant list advance the index of the first list and the index of the resultant list so that they will point to the next term if the element of the first list is smallerplace the element of the second list in the resultant list advance the index of the second list and the index of the resultant list so that they will point to the next term repeat this process until all the elements of either the first list or the second list are compared if some elements remain to be compared in the first list or in the second listplace those elements in the resultant list and advance the corresponding index of that list and the index of the resultant list suppose the first list is and the second list is the sorted lists are and the first element of the first list is which is smaller than so the first element of the resultant list is now is compared with again it is smallerso the second element in the resultant list is next is compared with in this case it is greaterso the third element of the resultant list is repeat this process for all the elements of the first list and the second list the resultant list is lab exercise program#include #include void main(void read(int *,int)void dis(int *,int)void sort(int *,int)void merge(int *,int *,int *,int)int [ ], [ ], [ ]clrscr()printf("enter the elements of first list \ ")read( , )/*read the list*printf("the elements of first list are \ ")dis( , )/*display the first list*printf("enter the elements of second list \ ")read( , )/*read the list*printf("the elements of second list are \ ")dis( , ) /*display the second list*lovely professional university