design a worst-case o (n log n)-time divide-and-conquer algorithm that finds all pareto optimal points in a given point set without explicitly using a sorting algorithm. justify your answer