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