Consider the following computational problem.

Input: $,$ A sorted sequence $a_1,$dots,$a_n$ of $n$ integers stored in an array A and a number $v.$

Output: The number of times $v$ occurs in $A.$

For example, if $A$ is the array

and $v$ is $1,$ then $v$ occurs $2$ times in $A.$

Give an algorithm that solves the above problem in $O(logn)$ running time.