Q. Which of the following is true about the time complexity of the recursive solution of the subset sum problem? (Solved)
1. it has an exponential time complexity
2. it has a linear time complexity
3. it has a logarithmic time complexity
4. it has a time complexity of o(n2)
- a. it has an exponential time complexity