What is the name of the following algorithm? Algorithm Name-sort (A[1..n]) 1. if n=1 2. then exit 3. for index ←2 to n 4. do 5. x←A [index] 6. j← index −1 7. while j>0 and A[j]>x 8. do {A[j+1]←A[j] 9. j:=j−1 10. } 11. A[j+1]←x 12. . 13. End a. Bubble Sort Algorithm b. Quick Sort Algorithm c. Selection Sort Algorithm d. Insertion Sort Algorithm
