(d) (2 pt) Let's say we have a dataset with 3 classes, labeled A, B, and C, from which we want to build a classier using a decision tree. The following table displays how many points are in each class: Class Number of Points A 4 B 4 C 2 Recall from lecture that we want to minimize the weighted entropy of our splits. What is the weighted entropy of the following split? Node 1: 4 in class A, 0 in class B, 2 in class C; Node 2: 0 in class A, 4 in class B, 0 in class C. O 0 O 10 0 log2 glogz 5 o (%1082%1052 . %(_%1g2%_10g2 s 0 None of the above