Branching and looping routines contain conditions that are either true or false.

When is the base case first > last (where first is the index of the first item in the array and last is the index of the last item in the array) reached in a recursive binary search algorithm?

What will be an ideal response?

The region of a program where an identifier can be referenced is called the ______ of the identifier.

Fill in the blank(s) with the appropriate word(s).