Please help setup in LINDO, that is it.

Just do part a. I do not understand how to setup in LINDO. Please show how to do so.. that is all

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 Formal statement [edit ] Given a set of bins S, 2. . . with the same size V and a list of n items with sizes al, . . . , an to pack, find an integer number of bins B and a partition Si U . . . U SB of the set 1, . . . , n} such that> a s V for all k-1,... , B. A solution is optimal if it has minimal B. The B-value for an optimal solution is denoted OPT below. A possible Integer Linear Programming formulation of the problem is: minimize B- y, subject to B 21, i-1 E 1, 0,1 Vie,..,n rij [0, 1), V.,nVj. ..n] 1 if bin i is used and y 1 if item j is put into bin i.l5 where y 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 Formal statement [edit ] Given a set of bins S, 2. . . with the same size V and a list of n items with sizes al, . . . , an to pack, find an integer number of bins B and a partition Si U . . . U SB of the set 1, . . . , n} such that> a s V for all k-1,... , B. A solution is optimal if it has minimal B. The B-value for an optimal solution is denoted OPT below. A possible Integer Linear Programming formulation of the problem is: minimize B- y, subject to B 21, i-1 E 1, 0,1 Vie,..,n rij [0, 1), V.,nVj. ..n] 1 if bin i is used and y 1 if item j is put into bin i.l5 where y