Question $3($decision tree, $30/100).$

Consider the following data about $9$ samples of mushrooms with features: spotty, smelly,

smooth, and edible $($the class$).$

a$)(10/100)$ construct a decision tree using the following rules: $($i$)$ at each step compute

the gini index for every possible split considering all attributes $($except "Sample"$)$ and

select the split with the best gini value; $($ii$)$ stopping rule: when the gini value of a

node is zero or no further split is possible; $($iii$)$ the class of a leaf node is determined

by the majority rule $($breaking ties arbitrarily$).$ Draw the decision tree so constructed

below: