108) Which of these is the worst case time complexity of Quick Sort - and cannot be expressed in lower order terms ?

109) Which of these is the worst case time complexity of Merge Sort - and cannot be expressed in lower order terms ?

110) Which of these is the average case time complexity of Merge Sort - and cannot be expressed in lower order terms ?

111) Which of these is the time complexity involved in building a heap of n elements - and cannot be expressed in lower order terms

112) A heap is a particular kind of a binary search tree. This statement is: