Suppose you have a set of distinct keys or elements stored in a list. Let be the average number of elements accessed in satisfying a search query for a single element. Assume that each element is equally likely to be the target of a search.
If your answer is yes, explain why. If it is no, explain why not and give a more reasonable value, if one exists.
Would you expect be less than ? If your answer is yes, explain why. Otherwise, explain why not.
Note: you don't need to calculate or directly here; you merely need to reason about the effect of the reordering of list elements upon the search process