PROBLEM SET 4 (Take at home, 40 points) Someone is giving you the following dataset of 12 examples and is asking you to help them identify the root node of a decision tree algorithm that will ultimately determine if a patron will wait for a table to be freed in a restaurant or not. The features you are given are: PAT (PATRONS): how many people are in the restaurant (values are None, Some, and Full). PRICE: the restaurant's price range ($, $S, $$$ ) RAINING: whether it is raining outside. RESERVATION (RES): whether we made a reservation. TYPE: the kind of restaurant (French, Italian, Thai, or burger). WAIT-ESTIMATE (EST): host's wait estimate: 0 10, 10 30, 30 - 60, or > 60 minutes Pat Price Rain Res Type Will Wait Est No y = Yes y2 = No y3 = Yes Y4 = Yes Some $$$ No Yes French 0-10 Full $ No Thai 30-60 Some $ No No Burger 0-10 Full $ Yes No Thai 10-30 Full $$$ No Yes French >60 ys = No Some $$ Yes Yes Italian 0-10 None $ Yes No Burger 0-10 Some $$ Yes Yes Thai 0-10 Full $ Yes No Burger >60 Full $$$ No Yes Italian 10-30 None $ No No Thai 0-10 Full $ No No Burger 3060 y12 = Yes PS: Show all your calculations that lead to the determination of the root note. If just the root node is quoted you will be automatically granted the grade of 0. Make sure that your answer is clearly handwritten on paper or tablet or Yo = Yes y = No y8 = Yes yg = No y1o = No Yui = No