Please answer part B. Consider a sorting algorithm that takes as input an Array A of n numbers. It sorts the array by finding the smallest number in A and swaps it with A[1]. Then it looks for the second smallest number in A[2..n] and swaps it with A[2]. Continue this process for the remaining elements until the array is sorted. a) b) c) Write the pseudo code for this algorithm Provide proof of correctness for the algorithm. Give the worst case and the best case running times of this algorithm in -notation. 10 points 15 points 15 points