Let P be an array containing n integers. Let t be the lowest upper bound on the number of comparisons of the array elements, required to find the minimun and maximum values in an arbitrary array of n elements. Which one of the following choices is correct?