Suppose a list of increasing integers is 1,3,4,5,8,9,11.
Suppose we conduct the binary search algorithm on this list where we search for 8.
In the language of Algorithm 3 in the book, enter the correct values for the following variables for this particular search:
$x =$ $n =$ $a_2 =$ $a_4 =$

After the first iteration of the while loop, what are the values of the following variables?
$i =$ $j =$ $m =$

Intuitively, after the first iteration of the while loop, we have cut down our search to a set S of roughly half of the original numbers on the list. Check the numbers that are in the set S after the first iteration of the while loop:
$S$ has the following elements:

A. 5
B. 3
C. 11
D. 4
E. 9
F. 1
G. 8
After the second iteration of the while loop, some of the variables have altered values. Enter the values of the following variables after the second while loop iteration:
$i =$ $j =$ $m =$

After the third iteration of the while loop, some of the variables have altered values. Enter the values of the following variables after the third while loop iteration:
$i =$ $j =$ $m =$

After the 3rd iteration of the while loop, the while loop terminates and the variable `location' is computed. Enter the value for this variable in this case:
$location =$