What is the time complexity for a binary search, did why?

$O(logn),$ because each comparison eliminates half the search space.

$O(n),$ because, in the worst case, it always has to search every item.

$O(e^n),$ because in the worst case, it might have to search $n!$ possibilities.

$O(nlogn),$ because each comparison eliminates half the search space.