Design an algorithm that guesses the correct number in a guessing game (1--n) without guessing too high twice and uses f(n) guesses such that as n gets large, f(n)/n =0. In other words, the algorithm should be O(n^x) for some x<1. Explain this algorithm in words and use concrete examples.