$($Decision Tree and KNN$)(25$ points$)$ Consider a training set provided below which contains two boolean features and a continuous feature$\mathrm{.}1\mathrm{.}1$ How much information about the class would be gained by knowing whether or not the value of feature $C$ is

less than $400?$

$1\mathrm{.}2$ What is the information gain for feature A and B$?$

$1\mathrm{.}3$ Is the above data set preprocessed well for kNN algorithms?