Restaurant ID	Type	Price	Neighborhood	Restrictions	Enjoyed?
R1	Fast Food	$	Bethpage	Vegetarian	no
R2	Ethnic	$$	Plainview	Gluten Free	no
R3	Casual	$$	Plainview	None	no
R4	Casual	$$$	Hicksville	Vegetarian	no
R5	Casual	$	Bethpage	Vegetarian	yes
R6	Fast Food	$$	Plainview	None	yes
R7	Ethnic	$	Plainview	None	yes
R8	Casual	$	Hicksville	Gluten Free	no
R9	Fast Food	$$$	Bethpage	None	no
R10	Ethnic	$$	Hicksville	Vegetarian	yes
R11	Casual	$$	Hicksville	Gluten Free	yes

no (d) Out of curiosity, and to verify your decision tree accuracy, you decide to try them all. The results are: (10) Restaurant ID Enjoyed? R12 R13 yes R14 R15 yes R16 no no How good did your decision tree do? What is the test set error Etest(h)? What is the F1 score? Note: For this problem use the following definition of F1-Score: F1 = 2 x precision x recall precision +recall Where, given the number of true positives (TP), false positives (FP) and false negatives (FN) precision = TP + FP TP recall TP + FN (e) IF-THEN Rules: Translate the decision tree you generated in (a) into a collection of IF- THEN rules. [10] no (d) Out of curiosity, and to verify your decision tree accuracy, you decide to try them all. The results are: (10) Restaurant ID Enjoyed? R12 R13 yes R14 R15 yes R16 no no How good did your decision tree do? What is the test set error Etest(h)? What is the F1 score? Note: For this problem use the following definition of F1-Score: F1 = 2 x precision x recall precision +recall Where, given the number of true positives (TP), false positives (FP) and false negatives (FN) precision = TP + FP TP recall TP + FN (e) IF-THEN Rules: Translate the decision tree you generated in (a) into a collection of IF- THEN rules. [10]