procedure binary search $(x$ : integer, $a_1,a_2,$dots,$a_n$ : increasing integers$)$

$i$:$=1\backslash$brace $i$ is left endpoint of search interval $\backslash$rbrace

$j$:$=n\backslash$brace $j$ is right endpoint of search interval $\backslash$rbrace

while $m$:$={|}_{{?}_{?}}\frac{i+j}{2_{{?}_{?}}}|x>a_{m}i$:$=m+1j$:$=mx=a_i=$ixx$1256781011x=,n=,a_2=,a_4=i=,j=,m=i$

begin

$m$:$={|}_{{?}_{?}}\frac{i+j}{2_{{?}_{?}}}|$

$ifx>a_m$ then $i$:$=m+1$

else $j$:$=m$

end

$ifx=a_i$ then location : $=i$

else location :$=0$

Vbrace location $is$ the subscript $of$ term equal $tox,or0ifxis$ not found $\frac{?}{\text{r}\text{b}\text{r}\text{a}\text{c}\text{e}}$

Suppose our list $of$ increasing integers $is$ shown $in$ the table below

$1256781011$

Suppose $we$ conduct the binary search algorithm $on$ this list where $we$ search for $10.$

$(a)In$ the language $of$ the algorithm above, enter the correct values for the following variables for this particular search:

$x=,n=,a_2=,a_4=$

$$

$(b)$ After the first iteration $of$ the while loop, what are the values $of$ the following variables?

$i=,j=,m=$