only 2nd option is true.
selection sort involves determination of minimum for the suffix[i..n] for all i , so in every case it will do O(n^2)
insertion sort involves sorting the prefix[1..i] for all i , which it does by comparing previous element with the new element and pushing it in its right position . since every prefix is sorted in ascending array ,it will take O(n). however for any other array it will take O(n^2)