Please answer and motivate why it is the correct answer

The following array is the partial result of a sorting algorithm after the i'th iteration. 1 2 3 4 0 6 2 5 7 8 9 What could be the i and the algorithm? 3, smallest-first or largest-first insertion sort The algorithm is neither selection sort nor insertion sort. 4, smallest-first or largest-first selection sort 4, largest-first selection sort and largest-first insertion sort