Use python write a function named count(arr, a, b) which takes in a sorted array arr(size n) and returns the number of elements of the array which are in the closed interval [a, b]. You may assume that the elements of the array are numbers, but you should not assume that the elements are distinct. If the array is empty, you should return zero. If the interval [a,b] is empty as in the case when a > b, you should also return 0. your algorithm must have a worst case time complexity of (log n)