Answer Happy

Describe the time complexity of the following algorithm in terms
of the number of comparisons used. You must show all the steps
needed to arrive at the answer(s). Simply stating the answer or not
using the required method(s)/algorithm(s) will result in 0 points
awarded. (10 points)
procedure binary search(x:
integer, a1,a2,..., an: increasing
integers) i := 1 {i is the left endpoint of
interval}
j := n {j is right endpoint of interval}
while i < j
m := ⌊(i + j)/2⌋
ifx>am theni:=m+1 else j := m
if x = ai then location := i

else location := 0
return location{location is the subscript i of the term
ai equal to x, or 0 if x is not found}