Plz answer this question clearly. thx

4. Consider the following two problem:s BIN PACKING: Given n items with positive integer sizes s1,S2,..., Sn, a capacity C for bins and a positive integer k, is it possible to pack the n items using at most k bins? PARTITION: Given a set S of n integers, is it possible to partition S into two subsets S1 and S2 so that the sum of the integers in S1 is equal to the sum of the integers in S2? Show that PARTITION polynomial-time reduces to BiN PACKING