bugzpodder wrote:
i dont see what number of subsets have to do with anything.
for recursion:
pick the first alphabet, say 'c'
call ur recursive function with the smaller alphabet set (make sure you remove all the alphabet before the one you picked as well) so in this case you call ur recursive function with {d} by removing a,b,c
well, they don't have anything to do with anything, btu you use ! to find them, and therefore can define ! recursively, thereby satisfying the recursive usage requriement, and then solve the rest of the problem iteratively