For each of the following situations,name tge best sorting algorithm we studied.(a) the array is mostly sorted a few element in wrong place. (B) you need an o(nlogn)sort even in the worst case and you can't use any extra space except for a few local variable. (C)The data to be sorted is too big to fit in memory.so most of it on disk. (D)you have many data sets to sort seperarely and each one has only around 10 elements. (E)-you have a large data set,so you but all the data has only one of about 10 value for sorting purposes. (F)instead of sorting the entire data set you only need the k smallest element where k is an input to the algorithm but is likely to be much smaller than the size of entire data.

For each of the following situations,name tge best sorting algorithm we studied.(a) the array is mostly sorted a few element in wrong place.

(B) you need an o(nlogn)sort even in the worst case and you can't use any extra space except for a few local variable.

(C)The data to be sorted is too big to fit in memory.so most of it on disk.

(D)you have many data sets to sort seperarely and each one has only around 10 elements.

(E)-you have a large data set,so you but all the data has only one of about 10 value for sorting purposes.

(F)instead of sorting the entire data set you only need the k smallest element where k is an input to the algorithm but is likely to be much smaller than the size of entire data.