Not-All-Equal Satisfiability (NAE-SAT) is like SAT, but must be such that every clause contains at least one true literal and at least one false one. NAE-3-SAT is the special case where each clause has exactly 3 literals. We know that NAE-3-SAT is also NP-complete. Formally, NAE-3-SAT = { $ l is a boolean formula with a satisfying assignment of variables which also has at least one false variable in each clause }. = Let SET-SPLITTING = { S is a finite set and C = {C1, ..., CK } is a collection of subsets S, for some k>0, such that elements of S can be colored red or blue so that no C has all its elements colored with the same color}. Show that SET-SPLITTING is NP-complete by using NAE-3-SAT