3. Consider the following algorithm (A[1..n] is an array of numbers):

   for i = 1 to n -1 { min = i;

   for j = i+1 to n do { if (A[j] < A[min])

   min = j;

   }

   swap(A[i], A[min]) // exchange their contents }

   1. a) Guess what the algorithm does.

   2. b) Give an asymptotically (worst case) tight bound for the running time of

      the algorithm. Explain your answer.