Suppose there are n items which are belong to two sets, A and B, such that A intersects B yields a non-empty set C. I apply the following procedure:
-------------------------------------------------
Allocate each of the n items to a single item bin (so there will be n single-item bins)...