What is the minimum number of comparisons needed to find an element in a 225-element array that is neither the maximum nor minimum in the worst case?
A) 449 comparisons
B) 448 comparisons
C) 224 comparisons
D) 223 comparisons