As part of a new game show, contestants take turns making several integer guesses between 0 and 1,000,000 (inclusive). In scoring each round, the show's host needs to know which two guesses were closest to each other. Provide an asymptotically timeoptimal algorithm that answers this question, argue that it is correct, give and explain its time complexity