a$)$ Derive the Gini impurity criterion for decision trees and explain its relationship to maximizing information gain. Prove that a decision tree with perfect information gain minimizes the Gini impurity at each node.

b$)$ Formulate the decision tree learning problem as a constrained optimization problem with the objective of minimizing the expected risk and constraints based on tree depth and complexity. Discuss the trade$-$off between these factors.