5. Here is a generalized version of the selection problem, called multiple selection. Let A[1... n] multiple selection problen is to find the ki-th smallest number in A for all i = 1, 2, , m. Design an O (n log m) time (not O (n log n) time) algorithm for the multiple selection problem. (Hint: using divide-and-conquer technique.) (20 points) 5. Here is a generalized version of the selection problem, called multiple selection. Let A[1... n] multiple selection problen is to find the ki-th smallest number in A for all i = 1, 2, , m. Design an O (n log m) time (not O (n log n) time) algorithm for the multiple selection problem. (Hint: using divide-and-conquer technique.) (20 points)