6. Suppose that you are given k sorted sequences, each of size n. In a brute force manner, we can merge these k sequences in O(nk) time. Can you design a more efficient merge algorithm with a running time of O(nlogk) ? 7. You are given an array of n real numbers and asked to sort the numbers. The twist here is that many elements have duplicates and there are only k