The below shows a set of eight Scrabble pieces: OXX MOMON What is the entropy of the letters in this set? (Base is 2) Problem 6 (5 points). Consider a data set that contains 4 Boolean attributes A, B, C, and D, and a Boolean class y. For the Boolean expression below (between the class y and the rest of the attributes), it is possible to construct a smaller decision tree that perfectly classifies the data without generating the complete tree (i.e., the number of leave nodes is less than 16). Then, draw such a tree. y=AABACAD