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 will fit into < = k bins) is np-complete. there is no known polynomial time algorithm to solve the optimization version of the bin packing problem. in this homework you will be examining two greedy approximation algorithms to solve the bin packing problem.-first-fit: put each item as you come to it into the first (earliest opened) bin into which it fits. if there is no available bin then open a new bin.- first-fit-decreasing: first sort the items in decreasing order by size, then use first-fit on the resulting list. implement in c++. both algorithms should be in a program called bin. cpp. your program should read in a text file named bin. txt with multiple test cases as explained below and output to the terminal the number of bins each algorithm calculated for each test case. your program should run with the command g++ bin. cppexample bin. txt: the first line is the number of test cases, followed by the capacity of bins for that 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.21065 10 2 5 4 410204 4 4 4 4 4 4 4 4 4 6 6 6 6 6 6 6 6 6 6sample output: test case 1 first fit : 4 - first fit decreasing : 3test case 2 first fit : 15 - first fit decreasing : 10