Q$2.$

$($i$)$ Consider the following set of training examples as shown in Table $2.$

Compute and draw a decision tree using $x$ as the first splitting attribute and then choosing

the best remaining attribute for doing the split as each successor node. Compute the

Classification Error to draw the tree.

Show all steps in calculations and explain them.

$($ii$)$ What is the overall error rate of the induced tree?

Table $2$

$($iii$)$ Now, compute and draw the decision tree using the greedy approach. Use the

classification error rate as the criterion for splitting. Show all steps and explain them.

$($iv$)$ What is the overall error rate of the induced tree?