Choice A is false because the asymptotic algorithmic complexity of quick sort is O(n2), whereas that of insertion sort is O(n2) and that of merge sort is O(n log2 n).
Choice B is true. The average asymptotic algorithmic complexity of quick sort is O(n log2 n), whereas that of insertion sort is O(n2) and that of merge sort is O(n log2 n). But when merge sort cannot be used, quick sort is certainly a reasonable alternative.
Choice C is false because quick sort is not a stable sort, but insertion sort and merge sort are stable. That is, quick sort may invert equal elements during partitioning, whereas insertion and merge sort never invert equal elements at any step.
Choice D is false because quick sort really needs to do many random accesses. In contrast, merge sort needs very few random accesses.