Consider the following data set containing examples e1, .., e5, each comprised of three binary input attributes ( 1,2,3) and one output label. Construct a decision tree for this data set. Compute information gain for each attribute. Select the attribute with the highest information gain as the root node. Then recursively create the children by recomputing information gain for each remaining attribute. Repeat this procedure until no more decision is necessary or possible. Show all necessary information gain calculations in each step