Definition of Every Case Time Complexity: "If an algorithm's best-case and worst-case complexity are the same then it has "every-case" complexity" i.e. Algorithm's time complexity does not depend on the input value.
In the Above
Quick Sort : Best (O(n.log n)) and Worst (O(n^2))
Insertion Sort : Best (O(n)) and Worst (O(n^2))
Selection Sort: Best (O(n^2)) and Worst (O(n^2))
Bubble Sort : Best (O(n)) and Worst (O(n^2))
Hence the answer is C) Selection Sort