(Choose 1 answer)
Given the Binary search algorithm (See picture)
Procedure Binarysearch(a₁<a₂<... <an x: integer)
i:=1
j:=n
If input = 2, 4, 5, 7, 8, 9, 10, 13 and x = 8, after the second time of dividing into sublists, the sublist to be considered is
A. 8, 9
while (i<j)
B. 7.8
m:=[(i+j)/2]if x> am then i:= m+1 else j:=m if x = a, then location: = i else location: = 0
C. 8, 9, 10
D. 5, 7, 8
Exit 39
