When is insertion sort most efficient?
1) When applied on an array with only a few elements out of place
2) When applied on an array with many elements out of place
3) When applied on an array with elements in descending order
4) When applied on an array with elements in ascending order