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

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

1. a) The list must be sorted
2. b) There should be direct access to the middle element in any sub list
3. c) There must be a mechanism to delete and/or insert elements in the list.
4. d) Number values should only be present