A phone company's bagged forest of five Decision Trees predicts whether a customer will leave or stay next month. For one customer, each tree sends them down to a leaf, and every leaf remembers the training customers that ended up in it:
| tree | training customers in the leaf | of whom left |
|---|---|---|
| 1 | 20 | 12 |
| 2 | 20 | 11 |
| 3 | 16 | 9 |
| 4 | 5 | 1 |
| 5 | 4 | 1 |
The forest can combine its trees in two ways.
Which statement correctly describes what the two rules predict for this customer?
Select all that apply.