Select all of the following statements about the bin packing problem that are true? The bin packing problem can be solved using integer programming. The set-partition problem can reduce to the decision version of the bin packing problem. There exists a 1-approximation polynomial time algorithm for the bin packing problem. The decision version of the bin packing problem is in P. First-Fit is a 2-approximation algorithm for the bin packing