Follow the selection sort algorithm to sort the following values. Show the contents of the array at each step so it is obvious you are following the algorithm. What is the efficiency class of the selection sort. Explain in two sentences the exhaustive search approach to solving a problem. Then state an example of an algorithm that uses this approach. Solve this assignment problem. Basic operation: Look at this algorithm for finding the uniqueness of the elements in an array: For i = 0 to n - 2 do for j = i + 1 to n - 1 do if A[i] = A[j] return false a) What is the basic operation? b) What does n represent? c) what situation would be the worst case? Summation: a) Find this sum: 1 + 3 + 5 + 7 + ellipsis + 999 b) Find this sum: Sigma^n+1_i=3 I What is meant by the asymptotic efficiency classes