Which of these statements about the binary search algorithm are true?

Multiple select question.

Given a sequence, each integer from $1$ to the size of the sequence can be the output of the binary search algorithm for some search term.

For every integer, there is some finite sequence such that the binary search algorithm does not end when searching the sequence.

The number of comparisons performed by the algorithm when given a search term that is in the sequence depends on the search term.

For all search terms and all sequences, the binary search algorithm continues splitting the sequence until it only contains one term.

The number of comparisons performed by the algorithm when given a search term that is in the sequence is independent of the search term.