Write a Haskell program that generates the list of all the subsets of the set [1..n] that have as many elements as their complements. Note: the complement of a set contains all the elements in [1..n] that are not members of the given set. Show the outputs for n=6.
4 freelancers are bidding on average $39 for this job
Hi! I have read all your description. I am professional C/C++ developer. I am sure high quality, good communication. Please contact me and Let's go ahead! Thanks.