Give an O (n log n)-time algorithm that takes an array A of n numbers that may contain duplicates (elements that are equal), and removes all duplicates from A. that is, each number in A should appear exactly once in the resulting array after the duplicates have been removed.