Given an array of characters, where every character is unique, please return all possible

subsets. The solution set must not contain duplicate subsets. You can return the solution in any

order.

For example, if the given array is $a,b,c$

The resulting vector of vectors should be $[[],[$a$],[$b$],[$c$],[$a$,$ b$],[$a$,$ c$],[$b$,$ c$],[$a$,$ b$,$ c$]]$

You should include two functions in your project:

main$()//$Initialize all variables, invoke the subsets functions, and output the results.

vector USING C$++$ with explanation