$[15$pts$]$ Consider a binary classification problem with two Boolean features, $x_{1}in\{0,1\},x_{2}in\{0,1\}.$ The training data are shown in the following figure where we have two points belonging to the positive $("+")$ class and the other two points belonging to the negative class $("-").$ Draw a decision tree that can perfectly classify the training data, that is$,$ all the training data points are classified correctly by the built decision tree.

Hint: features can be shared$/$reused by nodes at the same level of the decision tree. That is$,$ two child nodes with a common parent can have the same feature. You do not need to follow the general rule of finding the feature with maximum information gain for this problem.