Problem 1 (25 points). This problem is about the decision tree algorithm we discussed. Consider the following dataset: ID A1 A2 A3 Class 1 Medium Mild East Y 2 Low Mild East Y High Mild East N Low Mild West N Low Cool East Y Medium Hot West N High Hot East Y Low Cool West N 9 Medium Hot East Y 10 High Cool East Y 11 Medium Mild East Y 12 Low Cool West N Calculate the information gain of A2 and A3 and determine which is better as the test attribute at the root. You must show all calculations, including the calculation of info and information gain.|