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 or Matlab. Compare the optimal solutionsfrom the integer programming solutionsto your results using the approximation algorithms.

https://en.wikipedia.org/wiki/Bin_packing_problem

Example bin.txt: The first line is the number of test cases, followed by the capacity of bins forthat test case, the number of items and then the weight of each item. You can assume that the weight of an item does not exceed the capacity of a bin for that problem 10 5 10 2 544 10 20 44444444446666666666 Sample output: Test Case 1 First Fit:4 First Fit Decreasing:3 Test Case 2 First Fit: 15 First Fit Decreasing 10 Example bin.txt: The first line is the number of test cases, followed by the capacity of bins forthat test case, the number of items and then the weight of each item. You can assume that the weight of an item does not exceed the capacity of a bin for that problem 10 5 10 2 544 10 20 44444444446666666666 Sample output: Test Case 1 First Fit:4 First Fit Decreasing:3 Test Case 2 First Fit: 15 First Fit Decreasing 10