Q. Which of the following is not true about subset sum problem? (Solved)
1. the recursive solution has a time complexity of o(2n)
2. there is no known solution that takes polynomial time
3. the recursive solution is slower than dynamic programming solution
4. the dynamic programming solution has a time complexity of o(n log n)
- d. the dynamic programming solution has a time complexity of o(n log n)