The tvshows data set from as given in exercise 7.3 of Artificial Intelligence: Foundations of Computational Agents, is shown below

Examples	Comedy	Doctors	Lawyers	Guns	Likes
e1	false	true	false	false	false
e2	true	false	treu	false	true
e3	false	fasle	treu	true	true
e4	false	false	true	false	false
e5	false	false	false	true	false
e6	true	false	false	true	false
e7	true	false	false	false	true
e8	false	true	true	true	true
e9	false	true	true	false	false
e10	true	true	true	false	true
e11	true	true	false	true	false
e12	false	fasle	false	false	false

Assume that we are reporting errors based on the absolute error value (basically, each error counts as 1). Gove very brief answers to the following questions:

What is the optimal tree with one node only? What is the associated error?

What is the optimal tree with a depth of 2 (i.e. a root node with leaves as children)? What is the associated error? Which instances end up at each leaf?

What is the smallest tree that classifies correctly all training instances? How will it classify a new instance described as (Comedy = true, Doctors = true, Lawyers = true, Guns = true) and another one as (Comedy = false, Doctors = false, Lawyers = true, Guns = true)? Which of the two test instances allow us to say that the tree is able to generalize?

If you were building the tree using the information gain as a splitting criterion, what would be the root?