Question #$3.$ In the previous lesson, we saw that binary search requires fewer comparisons than linear search in the worst case. However, there are some cases for which linear search is more efficient. For which neighborhoods in the listing above would linear search require fewer comparisons than binary search?

Hint: for each neighborhood in the listing, calculate the number of steps it would take to find it using linear search, then calculate the number of steps it would take to find it using binary search.