6. Consider the following two decision problems. Partition: Given a set A of integers, can you partition the set into two subsets Al and A2 such that the sum of the elements of A1 equals the sum of the elements of A2, i.e., A1 A2 = A, A1 A2 = 0, and Li=A1 i = iEA2 ? Subset-Sum: Given a set A of integers and an integer K, can you find a subset Al of A whose elements sum to K, i.e., EAL i = K? Assuming Partition is NP-Complete, prove that Subset-Sum is NP-Complete.