Let x be a vector of n Boolean variables fX1, ..., Xng and let k be an integer less than n. Let fk be a target concept which is a disjunction consisting of k literals. Examples of f2 : X1 _ X2, X1 _ :X4, etc. Examples of f3: X1 _ X2 _ :X10, X1 _ :X4 _ :X7 etc.

State the size of the smallest possible consistent decision tree (namely a decision tree that correctly classifies all possible examples) for fk in terms of n and k and describe its shape.

Problem 2. (5pt) Let x be a vector of n Boolean variables (X1,.,Xn) and let k be an integer les than n. Let fk be a target concept which is a disjunction consisting of k literals Examples ofb : X2, X1 v-X4, etc. Machine Learning State the size of the smallest possible consistent decision tree (namely a decision tree that correctly classifies all possible examples) for fk in terms of n and k and describe its shape. Problem 2. (5pt) Let x be a vector of n Boolean variables (X1,.,Xn) and let k be an integer les than n. Let fk be a target concept which is a disjunction consisting of k literals Examples ofb : X2, X1 v-X4, etc. Machine Learning State the size of the smallest possible consistent decision tree (namely a decision tree that correctly classifies all possible examples) for fk in terms of n and k and describe its shape