please provide complete answer asap

Your proofs should be precise, concise and clear. When a question asks you to design an algorithm - it requires you to: . Clearly spell out the steps of your algorithm in pseudo code . Prove that your algorithm is correct Analyze the running time 1. (10 pts) Suppose that you have k sorted lists containing n distinct real numbers, in total. Show how to create a single sorted list containing the elements of all k lists in time O(nlogk)