a mathematician picks an integer 'i' from the set {1-16} (integers) and a logician tries to search for the number with yes or no questions. in this particular case, the evil, conniving mathematician can lie once, or not at all, to hinder the logician.

a) create a binary tree where, in any situation, the logician can ask seven boolean questions or less and determine the mathematician's number.