Find the average runtime complexity of binary search procedure binary search (x: integer, a_1, a_2, .., a_n: increasing integers) i: = 1 {i is the left endpoint of interval} j: = n {j is right endpoint of interval} while i a_m then i: = m + 1 else j: = m if x = a_i then location: = i else location: = 0 return location