A prize is randomly placed in one of 9 boxes, numbered from 1 to 9. You search for the prize by asking yes or no questions. Find the expected number of questions until you are sure about the location of the prize, under the following strategy.

A bisection strategy: you eliminate as close to half of the remaining boxes as possible by asking questions of the form 'is it in a box numbered less than or equal to k?'