Python recursion help

needed to count recursively the number of subsequences to a given string, please help.

Who codes on mobile !! :joy:

Though on a serious note,
If you only need to cound the number of subsequences, then it will be 2^n where n is the length of the string.

thanks dude, i just figured the mistake in the code haha my pc wasn’t available that time lol