Recall that in MergeSort algorithm, we used a linear-timesubroutine called Merge which merges two sorted lists into a singlesorted list. Now suppose there are k sorted lists and there are nelements in total in these k lists. Design an efficient algorithmthat merges these k sorted lists into one sorted list. The runningtime of your algorithm should be a function of both n and k.
