Assume you have enough memory to load the index into memory for binary searching. You have an index of 15000 keys. On average, how many comparisons will be involved in a successful search? Remember, you cannot make a part of a comparison; if the arithmetic gives you any fraction, you have to round up.