Write the program using recursion to find all the subsets of given string. Assume that if the given input is ―abcd, the output will be: Abcd, abc, abd, ab, acd, ac, ad, a, bcd, bc, bd, b, cd, c, d....

Write the program using recursion to find all the subsets of given string. Assume that if the given input is ―abcd, the output will be: Abcd, abc, abd, ab, acd, ac, ad, a, bcd, bc, bd, b, cd, c, d. write in c++ programming language.

solve in 40 minutes plz