During the recursive partitioning process, the CART algorithm determines the optimal split at each step by comparing the Gini indexes for all possible splits across all variables. The optimal split is the one that produces the $\_\_\_\_\_\_\_\_\_$ Gini index.