Given a set of n numbers, the k-partition problem is to determine whether or not S can be partitioned into k subsets of the same sum. For example, let S = {1,2,6,4,9). Then for two-partition problem, we can partition S into two subsets S = {1,6,4} and S2 = {2,9} such that the sum of elements in Sequals to the sum of elements in S2. Prove that the 2-partition problem can be transformed to the 3- partition problem (i.e., the 2-partition problem can be solved by using an algorithm that solves the 3-partition problem) (10%) and also describe the time of your transformation (including instance and solution transformation) (10%).

Answer rating: 100% (QA)

Suppose you have a set X to check if it is 2partitionable or not N... View the full answer