Give an O (n log n)-time algorithm that computes the union A B of an m-element set A and an n-element set B, where m n. the sets A and B contain numbers and are represented as arrays. The arrays are not necessarily sorted and there are no duplicates in either array. The output should be an array that represents the union AB and that contains no duplicates. (A and B may contain common elements.)