A prize is randomly placed in one of ten boxes, numbered from 1 to 10. You search for the prize by asking yes-no questions. Find the expected number of questions until you are sure about the location of the prize, under each of the following strategies.
a. An enumeration strategy: you ask questions of the form "is the prize in box k?"
b. A bisection strategy: you eliminate as close to half of the remaining boxes as possible by asking questions of the form: "is the prize in a box numbered less than or equal to k?"