Please explain your answer.

Problem 2 [5 points] Suppose we are given an array A in sorted order. Using the scheme justify your answer. contain n integers (i.e., L1.size)+L2.size) + sume each list is already given in sorted order. +Lk.size) -n); furthermore, as Give an O(n log k)-time algorithm (either in English or in pseudo-code) that merges the k sorted lists into a single sorted list containing all the integers. Briefly justify the correctness of your algorithm and why it achieves a run-time of O(n log k). lint: Use a min-heap