Answer (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. 5, 7, 8
B. 7.8
C. 8.9
D. 8, 9, 10
while (i<j)
m:=(i+j)/2]if x> am then i: = m+1 else j:=m if x = a; then location: = i else location: = 0
Exit 26
