An unordered list contains n distinct elements. The number of comparisons to find an element in this list that is neither the maximum nor the minimum is:
a) n
b) n−1
c) n−2
d) 2n−3