10. Consider the following algorithm and answer the questions. (10%) ALGORITHM W(A, I, T, K) // Input: A is an array of sorted integers, I and r are the leftmost and right most indexes of the // array elements to be processed, // K is an integer if l>r return-1 else [(1 + r)/2] if K = Am return m else if K