6. (5) Consider sorting n numbers stored in an array A by first selecting the smallest element and ex- changing it with A[1]. The finding a second smallest element and exchanging it with A[2], an continue for the first (n-1) elements in the array. Write pseudocode for this algorithm and give the best case and worst-case running time