(b) [3 points] Consider a sorted array B with n > 2 integers, where n mod 2 = 0. Let ALGOB be an arbitrary algorithm that checks whether every value in B occurs exactly twice. Prove that ALGOB needs to make at least comparisons in the worst-case