The ID$3$ algorithm could be described as a greedy algorithm as it only

considers the best remaining attribute locally, namely at the node at which it is

branching, and performs no backtracking. Describe why this may lead to a suboptimal

decision tree in the sense that a different selection of attributes may lead to a decision

tree with better performance on a data set