Occurrence of number in array,with complexity log n algorithm and c

Question

Situation:

T [M] an array sorts in ascending order.

Write an algorithm that calculates the number of occurrences of an integer x in the