Print all the subsets of a string

(2^N - 1) subsets in all. Recursive solution. O(N * 2^N).

Desc : Time complexity is found by printing a random statement inside
first if of the function. It is printed 2^N times and it takes N
executions to reach that point in code.