Problem Partition:
Input: A multi-set S of integers.
Question: Can the multi-set S be partitioned into two multi-sets Sa and Sb such that the sum of the integers in Sa is exactly equal to the sum of the integers in Sb.
(a) Give a new yes-instance of Problem Partition.
(b) Give a new no-instance of Problem Partition.
(c) Prove that Problem Partition is in the class NP