1. Given k sorted lists Ly.Lg..,ILi of"/k numbers each with 1 s ks n, design a divide-and- conquer algorithm to sort all n numbers in the k sorted lists. Your algorithm should run in O(n log k) time (instead of O (n logn) time) (20 points) Note: 0 points will be given for this problem if your algorithm is not based on the divide-and- conquer technique 12.k 2. Let A1. n] and B[1... n] be two arrays, each containing n numbers already sorted in the increasing order. Design an O (log n) time algorithm to find the median of all 2n elements in A and B. (The median of the 2n elements is the n-th smallest element.) (20 points)