You are given an array of n elements and you noticed that some of these elements are duplicate; that is they appear more than once in the array. Show that by doing some preprocessing work on the array, you can remove all duplicates from the array in O(n log n) time. Write your algorithm in pseudocode and analyze the running time of your algorithm. What is your expectation about the running time of an algorithm to remove the duplicates without doing the preprocessing work?