To analyze the sequential algorithm for the average-case efficiency allof the following are correct except one. Select one: O a. We must make some assumptions about possible input of size n. O b. The probability of a successful search is p (0 sps 1). O c. Possibility of the first match in the ith position of the list is the same for every i O d. The best case do not exceed n/2 when the element is not exist