1.a)True or false: If decision tree DT2 is an elaboration of tree DT1, then DT1 is more-general-than DT2.
Assume DT1 and DT2 are decision trees representing arbitrary boolean functions, and that DT2 is an elaboration of DT1 if ID3 could extend DT1 into DT2. If true give a proof; if false, a counterexample.
1.b) Suggest a lazy version of the eager decision tree learning algorithm ID3. What are the advantages and disadvantages of your lazy algorithm compared to the eager algorithm.