The binary search algorithm $\_\_\_\_\_\_\_\_.$

Group of answer choices

is less efficient than the sequential search algorithm

will cut the portion of the array being searched in half each time it fails to locate the search value

will have a maximum number of comparisons equal to the number of elements in the array

will, normally, have the number of comparisons that is half the number of elements in the array