SHOW IN LINDO PLEASE

DO NOT CODE IN C++ or PYTHON.. JUST LINDO

Problem 2: (10 pts) An exact solution to the bin packing optimization problem can be found using 0-1 integer programming (IP) see the format on the Wikipedia page. Write an integer program for each of the following instances of bin packing and solve with the software of your choice. Submit a copy of the code and interpret the results a) Six items S 4,4, 4, 6, 6, 6) and bin capacity of 10 b) Five items S 20, 10, 15, 10, 5) and bin capacity of 20 Problem 2: (10 pts) An exact solution to the bin packing optimization problem can be found using 0-1 integer programming (IP) see the format on the Wikipedia page. Write an integer program for each of the following instances of bin packing and solve with the software of your choice. Submit a copy of the code and interpret the results a) Six items S 4,4, 4, 6, 6, 6) and bin capacity of 10 b) Five items S 20, 10, 15, 10, 5) and bin capacity of 20