Which of the following is not true about set partition problem?

A. the recursive solution has a time complexity of O(2n)

B. there is no known solution that takes polynomial time

C. the recursive solution is slower than dynamic programming solution

D. the dynamic programming solution has a time complexity of O(n log n)

Answer: Option D