Exercise 2.7. Show that the celebrity problem can be solved by using 3n - log n - 3 questions (assume that n is a power of 2). (Hint: Group people into pairs similar to a knockout tournament, e.g., Wimbledon tennis tournament.)

Celebrity Problem: A celebrity among a group of n people is a person who knows nobody but is known by everybody else. The task is to identify a celebrity by only asking questions to people of the following form: Do you know this person ?. Design an efficient algorithm to identify a celebrity or determine that a group has no such person. What is the largest number of questions your algorithm needs to solve this problem?