Which of the following is true about the time complexity of the recursive solution of set partition problem?

• A. It has an exponential time complexity
• B. It has a linear time complexity
• C. It has a logarithmic time complexity
• D. it has a time complexity of O(n2)