The next questions refer to binary search used in the rank method in class BinarySearchST $($code seen below$).$

Assume integer keys with sorted keys array: int$[]$ keys $=\{10,20,30,40,50,60,70\}$; So initially in rank lo $=0$ and $hi=6.$

For each of the next $10$ questions the answer will be a number between $-1$ and $7.$

public int rank$($Key key$)$

$\{$

int lo $=0,$ hi $=N-1$;

while $($lo $$ hi$)$

$\{$

int mid $=l_0+\frac{hi-l{o}_o}{2}$;

int $cmp=$ key.compareTo$($keys$[$mid$])$;

if mid$-1$;

else if $(cmp>0)$ lo $=$mid$+1$;

else return mid;

$\}$

return lo;

$\}$

Question $1$: For binary search for $30$ in the keys array, what is the final value of lo$?$

Question $2$: For binary search for $30$ in the keys array, what is the final value of hi$?$

Question $3$: For binary search for $5$ in the keys array, what is the final value of lo$?$

Question $4$: For binary search for $5$ in the keys array, what is the final value of hi$?$

Question $5$: For binary search for $15$ in the keys array, what is the final value of lo$?$

Question $6$: For binary search for $15$ in the keys array, what is the final value of hi$?$

Question $7$: For binary search for $25$ in the keys array, what is the final value of lo$?$

Question $8$: For binary search for $25$ in the keys array, what is the final value of hi$?$

Question $9$: For binary search for $65$ in the keys array, what is the final value of lo$?$

Question $10$: For binary search for $65$ in the keys array, what is the final value of hi$?$For binary search for $65$ in the keys array, what is the final value of lo$?$