Consider the linear search problem, observe that if the array A is sorted, we can check the midpoint of the array against x and eliminate half of the sequence from further consideration. Binary search is an algorithm that repeats this procedure, halving the size of the remaining portion of the sequence each time. A recursive version of the BINARY-SEARCH algorithm is given below: RECURSIVE-BINARY-SEARCH(A, X, high, low) 1 if low > high 2 return 0 3 mid = (low+high)/2 4 if x = A[mid] 5 return mid 6 else if x > A[mid] 7 return RECURSIVE-BINARY-SEARCH(A, X, mid +1, high) 8 else return RECURSIVE-BINARY-SEARCH(A, X, low, mid-1) Your task is to write pseudocode for an iterative version of binary search. Write your algorithm here