Similar to the approach proposed by Himanshu1 here:
https://gateoverflow.in/27194/tifr2014-b-9
Construct a decision tree to determine the minimum element: $n - 1$ comparisons
Maximum element can be found from the same tree as it will be the biggest element out of $\frac{n}{2}$ elements at the first level which lost the decision: $\frac{n}{2} - 1$ comparisons
Therefore, the resultant number of comparisons: $3(\frac{n}{2}) - 2$, tighest bound on which is option (C).