element of the array; otherwise, search recursively by comparing K with A[n/3], and if K is larger, compare it with A[2n/3] to determine in which third of the array to continue the search. a. What design technique is this algorithm based on? b. Set up a recurrence for the number of key comparisons in the worst case. You may assume that n = 3k. c. Solve the recurrence for n = 3k. d. Compare this algorithm’s efficiency with that of binary search.