Demonstrate how the following instance of the 3SAT problem can be reduced to its corresponding Sum of Subsets problem. Consequently prove that the Sum of Subsets problem belongs to the class of NPC...

Demonstrate how the following instance of the 3SAT problem can be reduced to its corresponding Sum of Subsets problem. Consequently prove that the Sum of Subsets problem belongs to the class of NPC problems, if 3SAT is in NPC also.

= (xyz) (-x-y-z) (xyz) (-x-yz)

where x=0, y=0, 2-1, and represents negation