Let DIV= { | A is a finite set and S = {S_1, S_2, ... , S_k} is some collection of subsets of A, where k > 1, such that elements of A can be colored with one of two colors so that no S_i has all its elements having same color}. Prove that DIV is NP-complete