The binary search algorithm. an: increasing integers) procedure binary search (x: integer, a1,a2, i: = 1 {i is left endpoint of search interval } = n {j is right endpoint of search interval} while ij i#x > am then i : = m + 1 else j : = m if x = ai then location : = i else location : = 0 return location location is the subscript i of the term a equal to x, or 0ifx is not found) 26. change algorithm 3 so that the binary search procedure compares x toam at each stage of the algorithm, with the algorithm terminating if x = am, what advantage does this version of the algorithm have? 2. (20 points) exercise 26, p. 203. provide pseudocode and complexity for this algorithm. change algorithm 3, p. 195, so that the binary search procedure comparesr to am at each stage of the algorithm, with the algorithm terminating if am (a) write what an advantage has this version of the algorithm. (b) write a formula for a function which expresses the number of comparisons for the elements of a sorted sequence , an against the target z in the worst and the best cases. (c) classify the algorithm in the worst case using the big-o asymptotic notation.