Consider the data points for attributes x an dy as shown in the figure below. The '+' and 'O' symbols denote the points belonging to two different classes.

a.) Draw the partition lines that you think a good decision tree learning algorithm would draw. Partition the data space until you have created regions of pure classes.

b.) Show the decision tree in tree-like structure for the partitioning of the data space that you have drawn in the figure above.