4. k-way merge. Use a heap to design an O(n log k)-time to merge k sorted lists into one sorted list, where n is the total number of elements in all the input lists Note: Your algorithm should use space O(k) of internal memory, reading the input lists as streams, and 40 as a stream