Question 10 (3 points) Listen The following algorithm denotes function X (array A) for i from 1 to length[A] -1 do value = A[i] j := 1-1 while j >= and A[J] > value do A[j+1] := A[j] j:- 3-1 done A[j+1] = value done Selection Sort Insertion Sort Linear Search None of the above