Identify the correct sequence of performing a binary search.

Group of answer choices

$1.$ Binary search first checks the first element of the list.

$2.$ If the search key is not found, the algorithm:

i$.$ checks the middle element of the list or

ii$.$ checks the right sublist if the search key is greater than the middle element.

$1.$ Binary search first checks the middle element of the list.

$2.$ If the search key is not found, the algorithm:

i$.$ checks the right sublist if the search key is less than the middle element or

ii$.$ checks the left sublist if the search key is greater than the middle element.

$1.$ Binary search first checks the middle element of the list.

$2.$ If the search key is not found, the algorithm:

i$.$ checks the left sublist if the search key is less than the middle element or

ii$.$ checks the right sublist if the search key is greater than the middle element.

$1.$ Binary search first checks the last element of the list.

$2.$ If the search key is not found, the algorithm:

i$.$ checks the first element of the list or

ii$.$ checks the right sublist if the search key is greater than the middle element.