1. (5 points) Consider sorting n numbers stored in array A by first finding the smallest element of A and exchanging it with the first element in A[1]. Then find the smallest element of A[2.. n), and exchange it with A[2]. Continue in this manner for (n-1) times total. la) Write iterative pseudocode for this algorithm, which is known as selection sort. 1b) What loop invariant does the outer loop of this algorithm maintain? 1c) Why does it need to run for only the first n - 1 elements, rather than for all n elements? 1d) Give the best-case and worst-case running times of selection sort in O-notation