Sorting

There is an unsorted list of n integers. You are given 3 distinct integers and you have to check if all 3 integers are present in the list or not. The only operation that you are allowed to perform is a comparison. Let A be an algorithm for this task that performs the least number of comparisons. Let c be the number of comparisons done by A. Then,