Develop a divide and conquer algorithm that will find the number of l's in a sorted binary array. That is, if the list is [0, 0, 0, 1, 1, 1, 1] the answer should be 4, and find the recurrence relation for problem #2 and state the asymptotic complexity of the solution.