Ans C)
A has sorting time faster than B , generally but not always
Because quick sort differ in worst case running time than merge sort and heap sort
Again Bubble sort, insertion sort has O(n) time complexity in best case , where in other case has O(n2) complexity
So, we cannot say Array A sort any array faster than B