Consider the training dataset given below. X$1,$ X$2,$ X$3$ and X$4$ are the at$-$ tributes$/$features and Y is the class variable. Y X$1$ X$2$ X$3$ X$4+10101+11010+1110+10001+11110-10011-10000-1001010000011()$ Learn a decision tree using the ID$3$ algorithm. Show your computation steps. $($b$)$ Draw a decision tree having only $4$ leaf nodes, $3$ internal nodes and depth bounded by $2,$ that has $100\%$ accuracy on the given dataset. $($c$)$ For the two trees in $($a$)$ and $($b$),$ which decision tree will you prefer? Please explain your answer.