1. Write pseudocode for an O(n lg k)-time algorithm to merge k sorted lists into one large sorted list, where n is the total number of elements in all the input lists combined. Analyze your time complexity. (Hint: Use a min-heap.) Assume that each value is marked with the list that it originally came from.