5. A list of n integers may contain duplicate elements of the same value. Give a method that can find all duplicate elements faster than O(n2). Explain your answer. (20%)

6. Explain the reasons that quick sort cannot efficiently sort massive amounts of data that do not fit into available main memory. Describe an external sort algorithm that can efficiently sort data in the slower external memory. (10%)