18.13 In this ^exercise, we will consider the expressiveness of decision lists, as defined in Section 18.6.

a. Show that if the tests can be of any size, decision lists can represent any Boolean function.

b. Show that if the tests can contain at most k literals each, then decision lists can represent any function that can be represented by a decision tree of depth k.