it’s called disjoint sets. An example is to let A= {odd integers} and B= {even integers}. Note that the union of these sets is all the integers but no individual number is in both sets. (ie. union is everything and intersection is empty). Define another way to accomplish this that is different than the example provided. Note that you should state what group you are using (if not the integers) and how you are dividing all the elements into two disjoint sets.