Given a list of sorted, distinct negative and positive integers, design a divide and conquer algorithm that finds the number of values with the absolute value K. What is the run time of this algorithm and apply it to this list {-7, -6, -5, 1, 2, 5 } for K = 5.