The first step performed by the binary search algorithm at each iteration is to:

Group of answer choices

Compare the search key with the middle element in the current subvector.

Compare the search key with the lowest element in the current subvector.

Count the number of elements in the current subvector.

Compare the search key with the highest element in the current subvector.