Task 1.3: (2 points) Consider the variant of the game Guess my number! when there is no upper bound on the integer number x to be guessed. We only know x > 8. Propose an algorithm to solve the problem using at most c. log2 x questions where c can be any constant number that does not depend on x; e.g. C= 8. Hint: First, try to find an upper bound r of x with as few questions as possible. Then, run Binary Search from the lecture. You can assume that it needs only log2 n questions when n is the size of the given interval containing 2