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