In the text box below, write down a divide and conquer algorithm for counting the number of entries itn a sorted array of ints that are sm aller than a given value. In other words, the function takes as input an array A and an int value and returns the your solution must use the divide and conquer technique. To get full credit, your solution should run in 0(lgn) time in the worst case (where n is the size of the array) and must work on arrays that contain duplicate entries. You can still get half credit for a solution that runs in (n) time in the worst case or that works only on arrays without duplicate entries. Hint1: Remember that every divide and conquer algorithm we've done on arraysrequires a recursive function that has extra param eters to indicate the sub range of the array that you are focusing on. You may add extra input parameters below. Hint2: If you are unsure how to start, you might begin by ignoring the fact that the array is sorted and coming up with a divide and conquer algorithm that isn't fast, but that works on an unsorted array first, and then, improve your algorithm by modifying it to take advantage of the fact that the array is sorted Input parameters : A-array of int, value : int Output: the nmber of ints in A that are smaller than value number of ints in A that areless than value. To set any credit