The search algorithm that will most usefully benefit from the fact that the elements of n array are already sorted is? A. Linear search B. Quick search C. Binary search D. random search Justify your answer with explanations

The recursive algorithm below takes as input an array A of distinct integers, indexed between s andf, and an integer k. The algorithm returns the index of the integer k in the array A, or ?1 if the integerk is not contained within A. Complete the missing portion of the algorithm in such a way that you makethree recursive calls to subarrays of approximately one third the size of A.• Write and justify a recurrence for the runtime T(n) of the above algorithm.• Use the recursion tree to show that the algorithm runs in time O(n).FindK(A,s,f,k)if s < fif f = s + 1if k = A[s] return sif k = A[f] return felseq1 = b(2s + f)=3cq2 = b(q1 + 1 + f)=2c... to be continued.else... to be continued.

Write the algorithm which finds the second maximum value of the array. Then find the complexity of the algorithm as Big O notation

I need help with this please. Make sure to add your reasonsand arguments for your decisions.

Let a[] be a sorted array of n integers. Search a given key, say k, on using the binary search method. Use Java method

do not plagiarise

Write pseudocode for a divide-and-conquer algorithm for finding the position of the largest element in an array of n numbers.