Assume that you are using binary search algorithm to find the position of element x=9 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, 21,22.increasing integers) i:= 1 {i is the left endpoint of interval) j:=n jis right endpoint of interval} whileij m:- Lli+j)/2] if x>, then i:=m+1 elsejem if x = a; then location :=i else location : 0 return location Select one: O a. 8 O b. 10 O c.5 O d.6