Assume that you are using binary search algorithm to find the position of element x=10 in the list L={1,2,3,4,5,6,7,8,9,10). What is the number of comparisons done by the algorithm until it finds the position of x? (Include all comparisons in your count!) Binary search algorithm is given as: procedure binary search(x: integer, a,22.,,: increasing integers) 1:= 1 {i is the left endpoint of interval} j:=n{j is right endpoint of interval) while i atheni:=m+1 elsej:=m if x = a, then location :=i else location :=0 return location Select one: O a. 7 O b. 10 O c. 6 O 0.5