It is well known that in a room of n people, the probability that at least two of them have the same birthday is over 1/2 if n > 23, which is a phenomenon known as the birthday paradox. Suppose, then, that you have a list of n people and their birthdays. Describe a way, in O(n) expected time, to test whether two of the people on this list have the same birthday.

Use psuedocode as well.