1. We want to finds both the smallest and largest numbers in a list of n numbers. It takes 2n comparisons if done separately. How many comparisons does it take for the following algorithm that achieve the same goal? Void find-both( int n, int S[], int\& smallest, int\& largest) \{