If it is known that the representation, by means of the k-DL decision lists, includes as a subset all the k-DT decision trees of maximum depth k, what is the relationship between the tests that are made to the decision lists of the k-DL type and their corresponding decision trees of the k-DT type? Knowing this, in the case of restaurant, what would be the maximum value of k, in the tree of figure 18.2?, and based on this, what would be the values of k for the case of decision lists (corresponding to said tree), and what would those possible lists be?