Decision Trees $(10$ points$)$

Consider the following data set comprised of three binary input attributes $($A$1,$ A$2,$ and A$3)$ and

one binary output:

Example A$1$ A$2$ A$3$ Output y

x$11000$

x$21010$

x$30100$

x$41111$

x$51101$

Use the algorithm in Figure $18\mathrm{.}5($page $702$ in Textbook AIMA$)$ to learn a decision tree for

these data. Show the computations made to determine the attribute to split at each node. Figure $18\mathrm{.}5$ is attached here.