A sorting technique is called stable if:

Which of the following statements is true?
I. As the number of entries in a hash table increases, the number of collisions increases.
II. Recursive programs are efficient
III. The worst case complexity for Quicksort is O(n²)
IV. Binary search using a linear linked list is efficient.

For merging two sorted lists of sizes m and n into a sorted list of size m+n, we require comparisons of

Merge sort uses