Implement the following algorithm in Java, using the Vector data structure for any $1-$D array, $2-$D array, or

linear algebra purposes.

BINARY$-$SEARCH$($A$,$ n$,$ T$)$

$1$ L $=0$

$2$ R $=$ n $1$

$3$ while L $<=$ R

$4$ m $=$ b$($L $+$ R$)/2$c

$5$ if A$[$m$]<$ T

$6$ L $=$ m $+1$

$7$ elseif A$[$m$]>$ T

$8$ R $=$ m $1$

$9$ else

$10$ return m

$11$ return $1//$ invalid, not found

Note that A is an array of values, of length n$.$ Note that T is the value to search for.