Can you prove that it is Np-Complete by reducing subset sum to it. Specify the exact values of the instance in bin packing, the bin capacity, and the k value for bin packing.

7. (15) Consider the general problem of bin packing where we have unlimited number of bins each of capacity B, and n objects of sizes x1,x2,,xn, where 0