There are 2 sets, A and B

A relation R map A’s elements to B’s elements.

R(a)=b

for each a, there may be more than 1 b existing in B, that is, R is a 1-n relation.

Write a program to list all sub sets of A which meet below:

  • All B elements are covered
  • the size of these sub sets is the least