Time and Space Complexity?

#1

Please tell the time and space complexity of this generating sub sequence problem

#2

Since it is pure recursion, time complexity will be exponential. Since there are 2 recursive calls, so time complexity is O(2^n) .Considering recursive stack taking extra space, the space complexity will be O(n).