The analysis for the number of visits in a binary search begins with the equation, $T(n)=T(\frac{n}{2})+1.$ What does the number $1$ represent in this equation?

The fact that the number of elements is odd.

The total number of recursions required.

The fact that we search either the left half or the right half, but not both.

One element visit before a recursive call on one half of the array.