Time complexity doubt

What is the complexity of the code for generation of subsequence (in THIS VIDEO) in O-notation.
Like of string s=“abc”

we use recursion in this video !

@prerak_semwal its exponential

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.