consider linear search. Observe that if the sequence A is sorted, we can check the midpoint of the sequence against v and eliminate half of the sequence from further consideration. The binary search algorithm repeats this procedure, halving the size of the remaining portion of thesequence each time. Write pseudo code, either iterative or recurrsive, for binary search.