3. (25 points)For the following sequentia efficiency, the best-case efficiency, and the ave the probability of a successful sea probability of the first match occurring same for every 1). ALGORITHM SequentialSear //Searches for a given value in a giv uential search algorithm, find the worst-case a the average-case efficiency (assuming Is equal to p ( O ps 1) and the ccurring in the ith position of the list is the M SequentialSearch(A[O..n-1). K) Input: An array ATO..n-1) and a searc //Output: The index of the first value in a given array by sequential search and a search key K ex of the first element of A that matches K I there are no matching elements while i <>