Give an O(n lg k)-time algorithm to merge k sorted lists into one sorted list, where n is the total number of elements in all the input lists. (Hints: Use a heap for k-way merging.). Please implement your algorithm in Python and submit some output to support your claim of performance.