Suppose that you are given an integer, x, and a sorted list of integers. Design and analyze a divide and
conquer algorithm that counts the number of occurrences of x in the list and runs in time O(log_(2)n).
Example: Suppose x=4 and the list is {1,2,2,2,4,4,12,20,20,20}. Your algorithm should return 2 .
Write the pseudocode, lemma, proof of lemma and time complexity
5. Suppose that you are given an integer, , and a sorted list of integers. Design and analyze a divide and conquer algorithm that counts the number of occurrences of x in the list and runs in time O(log2 n).
Example: Suppose x = 4 and the list is {1,2,2,2,4,4,12,20,20,20}. Your algorithm should return 2.