Two subsets of the set $S=\{ a,b,c,d,e\}$ are to be chosen so that their union is $S$ and their intersection contains exactly two elements. In how many ways can this be done, assuming that the order in which the subsets are chosen does not matter?
The solution for this problem is available for $0.99.
You can also purchase a pass for all available solutions for $99.