The powerset of set s is a set containing all subsets of s.

I need a clue on how to write Haskell code to get the superset of a set using direct recursion and list comprehension.

Best regads.