In the context of decrease$-$and$-$conquer algorithms, specifically focusing on the decrease$-$by$-$a$-$constant$-$factor variant, which of the following statements are true? $($Multiple answers may be correct. Select all that apply.$)$

Please be aware that there will be point deductions for incorrect answers.

It often involves iterative deepening techniques.

The problem is usually divided into two smaller subproblems of equal size.

The approach is commonly used in algorithms like binary search.

The problem size is typically reduced by half in each iteration.

The algorithm relies on randomness to determine the constant reduction factor each time.

The problem is repeatedly divided until it becomes trivially small.