Consider the list of states from Figure 8.5. Which state in the list is the "easiest" to find using binary search? That is, which state could be located in the fewest number of checks? Generalize your answer so that it applies to any sorted list of items.