Write a algorithm with example and code of selection sort

23. Consider again the array a = {5,7,1,4,1} and the Selection Sort (code 2) algorithm. What is the last value of the variable minPos, before the algorithm exits? (A) 0 (B) 4 (C) 2 (D) 5 (E) 1

Part (a) [1 MARK] The list below is shown after each pass of a sorting algorithm. ['M', 'A', 'D', 'E', 'B', 'F', 'C'] # initial list Which sorting algorithm is being executed? (circle one) (a) bubble sort ['A', 'D', 'E', 'B', 'F', 'C', 'M'] # after one pass ['A', 'D', 'B', 'E', 'C', 'F', 'M'] # after two ['A', 'B', 'D', 'C', 'E', 'F', 'M'] # after three ['A', 'B', 'C', 'D', 'E', 'F', 'M'] # after four (b) selection sort (c) insertion sort

Part (b) [1 MARK] The list below is shown after each pass of a sorting algorithm. ['M', 'A', 'D', 'E', 'B', 'F', 'C'] # initial list | Which sorting algorithm is being executed? (circle one) (a) bubble sort ('A', 'M', 'D', 'E', 'B', 'F', 'C'] # after one pass ('A', 'B', 'D', 'E', 'M', 'F', 'C'] # after two ['A', 'B', 'C', 'E', 'M', 'F', 'D'] # after three ('A', 'B', 'C', 'D', 'M', 'F', 'E'] # after four ('A', 'B', 'C', 'D', 'E', 'F', 'M'] # after five (b) selection sort (c) insertion sort