Suppose you are given k n-element sorted sequences Ai , each representing a set (none has duplicate entries). But one element can appear in more than one of these Ai s. Describe an O(nk log k)-time method for computing a sorted sequence representing the set k i=1Ai (with no duplicates). You do not have to argue correctness (but, obviously, your method must be correct), but must justify the running time.