A recursive binary search algorithm always reduces the problem size by $\_\_\_\_\_\_$ at each recursive call.

$2$

one$-$third

$1$

half