$\underline{\textbf{Answer:}\Rightarrow}\;\textbf{c.}$
$\underline{\textbf{Explanation:}\Rightarrow}$
In insertion sort, if the array is already sorted then it takes $\mathbf{O(n)}$. If the array is reverse sorted then it takes $\mathbf{O(n^2)}$.
In quick sort, if the array is already sorted or sorted in the reverse order, then it takes $\mathbf{O(n^2)}$.
The best and worst-case performance of the Selection sort is $\mathbf{O(n^2)}$ only.
But in case the array is already sorted then fewer swaps take place.
In the case of Merge Sort, the time complexity is always $\mathbf{O(nlogn)}$ for all the cases.
In short, Merge sort is Non-Adaptive in nature but rest of algorithms are.
$\underline{\text{Adaptive Sorting:}}$
If order of the elements to be sorted of an input array matters (or) affects the time complexity of a sorting algorithm, then that algorithm is called “Adaptive” sorting