8. Let X be a set of n natural numbers. Consider the task of finding a pair of numbers in X whose difference is 100. Use Theorem 5.1 to find a lower bound on the worst-case number of binary comparisons needed to accomplish this task. Give an exact answer, and also a big- estimate.