Again, consider the list of states. Which state in the list is the "hardest" to find using binary search? That is, which state would require the largest number of checks to be located? Generalize your answer so that it applies to any sorted list of items.

What will be an ideal response?

One of the hardest states would be "WY", which appears at the end of the list. Since the search always checks the middle of the range, the end will only be reached when the range is reduced to size 1.