Suppose n integers between 1 and 366 are presented as input, and you want to know if there are any duplicates. How would you solve this problem? What is the rate of growth of the function T(n),...

Suppose n integers between 1 and 366 are presented as input, and you want to know if there are any duplicates. How would you solve this problem? What is the rate of growth of the function T(n), describing the time it takes for you to determine if there are duplicates? (Hint: Pick an appropriate n₀.)