"Will John Play Tennis? " is the example has presented in class to demonstrate the ID3 algorithm.  The ID3 is based on the idea of Entropy.  It uses Information Gain to  determine the splits required to generate the full tree.

Your task is to work out the complete tree, starting at the root node.  At each split you should consider the alternatives and make the right choices, starting from the root.