$7.$ A larger Node Impurity of a node in a decision tree means:

$($A$)$ Smaller Entropy

$($B$)$ Smaller Gini function value

$($C$)$ Larger Classification error

$($D$)$ Larger Information gain