(10 points) Let L be a list of numbers in non-decreasing order, and x be a given real numbers. Describe an algorithm that counts the number of elements in L whose values are x. For example, if L={1.3,2.1,2.1,2.1,2.1,6.7,7.5,7.5,8.6,9.0} and x=2.1 then the output of your algorithm should be 4 . Your algorithm should run in O(logn) time