Question : Answer the following questions
a) Explain why Merge sort is the most suited for very large inputs (that do not fit inside memory) while quick sort and heap sort are not as suited.
Note that these three sorting techniques have comparable time complexities.
b) Can Merge sort be performed in place? Explain your understanding.