Which statement is INCORRECT about decision tree algorithms?

$$a$)$ In decision tree algorithm, the fully grown tree always has higher or equal training accuracy than pruned trees.

$$b$)$ In decision tree algorithm, the fully grown tree always has higher or equal testing accuracy than pruned trees.

$$c$)$ In decision tree algorithm, pre$-$classified target variables must be included in training set.

$$d$)$ C$4\mathrm{.}5$ decision tree algorithm produces a separate branch for each categorical value at the split node.