An exactsolution 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 named binIP.cpp that takes as input the bin.txt file and produces as output the corresponding problems in integer programming formatthat can be solved using LINDO. Compare the optimal solutionsfrom the integer programming solutionsto your results using the approximation algorithms.

Problem: 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. The decision version of the bin packing problem (deciding if objects willfit into