1. (Decision Tree and KNN) (25 points) Consider a training set provided below which contains two boolean features and a continuous feature. A B C Class row 1 T 115 row 2 T F 890 row 3 T T 257 row 4 F F 509 row 5 T T 733 + 1.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.2 What is the information gain for feature A and B? 1.3 Is the above data set preprocessed well for kNN algorithms