tamarahawkins2324 tamarahawkins2324 28-02-2024 Mathematics contestada Assuming it is possible to sort n numbers in O(n log n) time, show that it is possible to solve the three-way set disjointness problem in O(n log n) time. Geek for Geeks. a) True b) False