(Choose 1 answer)
Given the Binary search algorithm (See picture)
procedure Binarysearch (a₁<a2<...<an, x: integer)
i:=1 j:=n
while (i<j)
If input 2, 4, 5, 7, 8, 9.10. 13 and x = 11, after the second time of dividing into sublists, the sublist to be considered is_
A. 10, 13
m:=[(i+j)/2]
if x> am then i: = m+1 else j:=m
13/50-CAP
if x = a; then location: = i else location: = 0
B. 10
C. 9, 10
D. 9, 10, 13
R
Q: 15
