An unordered list contains n distinct elements. The number of comparisons to find an element in this list that is neither maximum nor minimum is
1
Ɵ(n log n)
2
Ɵ(n)
3
Ɵ(log n)
4
Ɵ(1)
An unordered list contains n distinct elements. The number of comparisons to find an element in this list that is neither maximum nor minimum is