the following sequential search algorithm, find the worst-case y, the best-case efficiency, and the average-case efficiency (assuming hty of a successful search is equal to p (0 SPS 1) and the the first match occurring in the ith position of the list is the a given array by sequential search 3. (25 points for the following sequential search efficiency, the best-case efficie the probability of a successful search is e probability of the first match occurring same for every 1). ALGORITHM SequentialSearch(A[O...n-1), K) Searches for a given value in a given array by sequen Input: An array AlO..n-1) and a search key K 1/Output: The index of the first element of A that matches or -1 if there are no matching elements i0 while i <>