Write out the algorithm $($pseudocode$)$ to find K in the ordered array by the method that compares K to every m$-$th entry $(1<$ m is less than array size n$)$ until K itself or an entry larger than K is found, and then, in the latter case, searches for K among the preceding m$.$ How many comparisons does your algorithm do in the worst case?