Answer 1

The major reason has to do with merge sort using an auxiliary array whereas quick sort does the sorting in place.
Big-Oh notation isn't the end of the story there is a lot of in depth analysis with these 2 algorithms.
An example is Java uses a variation of quick sort for primitive types and merge sort for reference types, which involves further information than just O(n log n)