1. You are given a string str. 2. Complete the body of printSS function - without changing signature - to calculate and print all subsequences of str. Use sample input and output to take idea about subsequences. Note -> The online judge can't force you to write the function recursively but that is what the spirit of question is. Write recursive and not iterative logic. The purpose of the question is to aid learning recursion and not test you.
Input Format
A string str
Output Format
Subsequences of str in order hinted by Sample output
Constraints
0 <= str.length <= 7
Notice
Try First, Check Solution later
1. You should first read the question and watch the question video.2. Think of a solution approach, then try and submit the question on editor tab.3. We strongly advise you to watch the solution video for prescribed approach.Example
Input
yvTA
Output
yvTA yvT yvA yv yTA yT yA y vTA vT vA v TA T A