Which of the following is not a required condition for a binary search algorithm?

Question $1$ options:

The list must have an even number of elements.

The list must be sorted.

There should be direct access to the middle element in any sub$-$list.

Low and high markers must be set up$.$