Using Matlab to solve following question:

Algorithm. Given an array A of n elements with values or records A1,. . . , An and target value , the following subroutine uses binary search to find the index T in A (a) Set L to 1 and R to n (b) If L> R, the search terminates as unsuccessful. Set m (the position of the middle element) to the floor of (L R)/2. (c) If Arn T, set L to m + 1 and go to step 2. (d) If A > T, set R to m 1 and go to step 2 (e) If Am -T, the search is done; return m