Var D.
Information gain is one of the main metrics used by decision tree learning, others being Gini impurity and variance reduction. The Wikipedia page explains everything below:
Information gain is based on the concept of entropy and information content from information theory.
Consider an example data set with four attributes: outlook (sunny, overcast, rainy), temperature (hot, mild, cool), humidity (high, normal), and windy (true, false), with a binary (yes or no) target variable, play, and 14 data points. To construct a decision tree on this data, we need to compare the information gain of each of four trees, each split on one of the four features. The split with the highest information gain will be taken as the first split and the process will continue until all children nodes are pure, or until the information gain is 0.