Need complete solution for this

Algorithms

5 Heap Recal in class I described how one can merge two sorted lists into a single sorted list. Now suppose you are given k sorted lists with n elements in total, and you want to merge these k sorted lists into a single sorted list. Now give an O(nlogk) algorithm for this problem. Hint: use a heap for k-way merging