Finding an element in an unordered list that is neither the maximum nor the minimum requires comparing each element of the list with the current maximum and minimum values. Let's break down the solution to understand why the correct answer is option 'D' (1 comparison).

1. Explanation:
To find an element in the list that is neither the maximum nor the minimum, we need to compare each element with the current maximum and minimum values. We keep track of the maximum and minimum values as we iterate through the list.

2. Algorithm:
The algorithm to find the element can be summarized as follows:
- Initialize the maximum value to the first element of the list and the minimum value to the last element of the list.
- Iterate through the list from the second element to the second-to-last element.
- For each element, compare it with the current maximum and minimum values.
- If the element is greater than the maximum value, update the maximum value.
- If the element is less than the minimum value, update the minimum value.
- After iterating through the entire list, we will have the maximum and minimum values.
- Iterate through the list again and compare each element with the maximum and minimum values.
- If an element is neither the maximum nor the minimum, we have found our element.

3. Number of Comparisons:
In the worst-case scenario, the element we are looking for is neither the maximum nor the minimum. In this case, we need to compare each element with the maximum and minimum values. Since there are only two values to compare with, we need only one comparison for each element.

Therefore, the number of comparisons to find an element in the list that is neither the maximum nor the minimum is 1.

In conclusion, the correct answer is option 'D' (1 comparison) because we only need to compare each element once with the maximum and minimum values to find the element in the list.