Consider two decision trees, T$1$ and T$2,$ where T$2$ is obtained by pruning some of the subtrees in

T$1,$ while T$1$ is the most exhaustive tree that can be created using classification error as the splitting

criterion. List all of the following statements that are always true and give a brief explanation.