Present an adversary argument as a lower bounds proof to show that \(n\) comparisons are necessary in the worst case when searching for an element with value \(X\) (if one exists) from among \(n\) elements.