Suppose that you are given the following data set shown below, where the true rule that classifies the positively labeled data points is (114) AND (25). Your goal is to learn a decision tree (using binary splits) on this data set that achieves zero training error. 6 5 4 3 2- 1- 0 5 6 x1 (a) Find the height of the minimum height tree that can achieve zero training error on this data set. Justify your answer. (b) Draw a decision tree of that height that perfectly classifies the data. Make sure you clearly label the nodes of your tree so we can use it to classify the data set.