Consider the following split at some node in a decision tree:

The following is the distribution of data$-$points and their labels:

NodeNum of pointsLabelsQ$11000$Q$11001$L$1500$L$1301$L$2500$L$2701$

For example, L$1$ has $80$ points of which $50$ belong to class $0$ and $30$ belong to class $1.$ Use log$2$log$2$ for all calculations that involve logarithms. Use three decimal places for all intermediate quantities.

$1$ point

If the algorithm is terminated at this level, then what are the labels associated with L$1$ and L$2?$

L$1$ : $0$

L$1$ : $1$

L$2$ : $0$

L$2$ : $1$