please help with questions 1 & 2

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) ( index i; smallest =S[1]; largest =S[1} for (i=1;iS[2i] ( If (S[2i1]> largest largest =S[2i1]; If [S[2i] largest largest =S[2i]; If [S[2i+1]