Problem 3 [20 points]: Suppose we are given k Array Lists L1, L2,.., Lk, which collectively contain n integers (i.e., L1. size() + L2. size() + + Lk. size() = n); furthermore, as- sume each list is already given in sorted order 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) Hint:Use a min-heap)