If there is a collection of integers with no particular order and with possible duplicates, how do you find out which numbers in the range of 0 to 99 are missing in this collection, and how is the time your solution will take related to n, the size of the collection?