Algorithm design - Part 3

Question 1 of 25 Hints: 3

Q1. A BINARY SEARCH looks for a certain name in a list of sixteen names. What is the most possible number of places it will have to check?