In the bin packing problem, items of different weights (or sizes) must be packed into a finite number of bins each with the capacity C in a way that minimizes the number of bins used. 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 a program that takes as capacity of bin and the wieghts of items and produces as output the corresponding problems in integer programming format that can be solved using LINDO or Matlab.