BinarySearch$($A$,$t$)$

Let start $=1$

Let end $=$ n

While start $<$ end:

Let mid $=($start $+$ end$)$ div $2$

If $($a$\_$mid $<$ t$)$ start $=$ mid $+1$

Else end $=$ mid

End While

If t $=$ a$\_$start return start

Else return $-1$

End

State the loop invariant for the while loop by finishing this sentence $$After an iteration

of the while loop...$$ with a precise statement about the relationship between A$,$ t $,$ start

and end.