rrect

Question $4$

$\frac{0}{1}$ pts

Given the new corrupted dataset, is it possible for a decision tree to classify all examples correctly? If yes, what is the minimum tree depth needed to achieve it$?$ If no$,$ why?

Yes, minimum tree depth is $1$

Yes, minimum tree depth is $2$

Yes, minimum tree depth is $3$

No$,$ the model is overfitting

No$,$ at least one example can never be correctly classified