Here is the pseudocode for Binary Search with some code added:L$\}=$i $=0$ i $=$ i $+1$ if A$[$C$]==$ TARGET return C R $=$ C$-1$ L$\}=\backslash$textrm$\{$C$\}+$end whilereturn FAIL

end$($a$)$ For the following list if we searched for each element in the list $($separately$)$ enter the

value of i which will be printed right before the return C$.$

$($b$)$ We search for a real number $x$ which is not in the list and the print statement prints the

$[4$ pts$]$

i$-$value $4$ right before the return FAIL. What can you say about the value of $x?$