here for the bucket sort it takes O(n2) in worst case but the quick sort takes O(n2) and merge sort takes O(n log n) but the radix sort takes O(n)for small elements and for larger digits it takes O(nlogn)
so as(1-100) are have small digit value radix sort is best with O(n) and quicksort takes O(nlogn) small inputs
for(0 to 1000000 integers ) merge is best
with the given options we can go for (i)quick sort (ii)merge sort
finally ANS:- is option (c) (i)quick sort (ii)merge sort