C++

Implement the function vector generate-subsets (string s) described in Problem P10.11 using recursion Write a program that prompts the user to enter a string s. Then generates all subsets of characters of the string s and display them (a subset per line) Note: a string s can contain letters that are repeated, say s-"bob". The algorithm should treat all letters as individual 'place holders' without taking into account its content. Thus, the number of subsets of characters for a string containing n characters must be 2" Note: an empty string is a subset of any string and hence it must be a part of the output. Sample input-output: C:Windowslsystem321cmd.exe Enter a string rum 8 subsets: um Hu LuM Continue (y> y Enter a string: bohb 8 subsets: "bob 0 "ob 0 Continue (y) y Enter a string: 1 subsets: Continue y> n Press any key to continue . _. Implement the function vector generate-subsets (string s) described in Problem P10.11 using recursion Write a program that prompts the user to enter a string s. Then generates all subsets of characters of the string s and display them (a subset per line) Note: a string s can contain letters that are repeated, say s-"bob". The algorithm should treat all letters as individual 'place holders' without taking into account its content. Thus, the number of subsets of characters for a string containing n characters must be 2" Note: an empty string is a subset of any string and hence it must be a part of the output. Sample input-output: C:Windowslsystem321cmd.exe Enter a string rum 8 subsets: um Hu LuM Continue (y> y Enter a string: bohb 8 subsets: "bob 0 "ob 0 Continue (y) y Enter a string: 1 subsets: Continue y> n Press any key to continue . _