Answer: a) A contact list is sorted.
Binary search checks the middle contact first because it relies on the assumption that the contact list is sorted. This sorting allows binary search to efficiently eliminate half of the remaining contacts with each comparison, reducing the number of comparisons required to find a specific contact. This property of binary search significantly improves search speed and efficiency when working with sorted data.