Suppose you just recently joined WOW enterprise. The company has over 1000 staff from across the globe. You are attending the company's annual meeting for the first time. The Chief Executive Officer (CEO)'s son, James is also attending the meeting this time. James does not know anyone in the meeting, but everyone attending the meeting knows James. You want to get to know James. You are allowed to ask only one question DoYouKnow(X, Y), i.e. you can ask only one question to X that do you know Y. In this case to Y would be James. X will answer the question yes or no.
Explain clearly how you can find James using only DoYouKnow(X, Y). Then, justify the complexity of your solution using the Big-Oh notation.
Guidelines: You may include illustrative diagram(s) with description to explain your solution, if necessary. Provide the necessary examples. You will be judged based on:
• Clarity of the solution (e.g. reproducible in programming form etc. by the reader) • Efficiency of the solution (refer to Unit 4 on Algorithm Complexity). Hints: Can you use a stack?