Read the statements below and select the most appropriate conclusion. Statement 1:…

Read the statements below and select the most appropriate conclusion. Statement 1: Any algorithm with a time complexity better than O(n²) is considered efficient for large datasets. Statement 2: Merge Sort has a time complexity of O(n log n). Which conclusion can be logically deduced?