1. The table below contains 12 examples with ten attributes each indicating whether or not a person will wait for a table in a restaurant.
We want to use this data and the ID3/Entropy technique to construct an accurate yet compact decision tree for this domain. To determine the optimal first attribute, you should independently calculate the Entropy after using each of the 10 attributes as the first choice. To being the tree, complete the table below.
| Attribute | Entropy |
| Nearby alternative (Alt) | |
| The restaurant has a bar (Bar) | |
| It is a weekend (Fri) | |
| The person is hungry (Hun) | |
| There are other patrons in the restaurant (Pat) | |
| The price of food in this restaurant (Price) | |
| It is raining outside (Rain) | |
| The person made a reservation (Res) | |
| The kind of restaurant (Type) | |
| The wait estimated by the host (Est) |
Continue this process to complete the decision tree. Submit both your tree and the above Entropy table.