Q. Let be a list of numbers in non-decreasing order, and be a given number. Design an algorithm that counts the number of elements in whose values are .

For example,if ={1.3,2.1,2.1,2.1,2.1,6.7,7.5,7.5,8.6,9.0} and = 2.1 then the output of your algorithm should be 4. Show the running time function (recurrence function if your algorithm uses recursion. Show your algorithm runs in (log ) time.