Please make sure you submit the homework via D$2$L$.$ Submit your written so$-$

lution in PDF format and the source files of your program as requested.

Draw the decision tree that perfectly classifies each of the data sets given

below. There could be more than one answer to each question $($you only

need to draw one$).$ Assume there are no noise and missing attribute values

in the data. Note: you should be able to draw the tree without explicitly

writing a code to do this.

$($a$)$ Consider a data set with three Boolean attributes, A$,$B$,$ and C$,$ and

a binary class label y whose value is True if the number of attributes

with True values is even and False if it is odd $($assume $0$ is even$).$ For

example, if A$=$ True, B$=$ True, C$=$ False, then y$=$ True $($because there

are two attributes with True values$).$

$($b$)$ Consider the two$-$dimensional data set shown in Figure $1.$ Each data

point is classified either as class A or class B depending on its x and

y positions in the two$-$dimensional plot.

ONLY NEED PART B$.$ Feel free to do A but please prioritize part B