Create a C++ program with the algorithm

Max - Rest for all elements i = 1, 2, 3 .... n Determine k= min {ilimi do the index of the bin J : with montante remaining capacity. (same line chove, not upart of note on board) if object i fits in bin k then Pack object l in binh else create new bin + pack object i and if end for Max - Rest for all elements i = 1, 2, 3 .... n Determine k= min {ilimi do the index of the bin J : with montante remaining capacity. (same line chove, not upart of note on board) if object i fits in bin k then Pack object l in binh else create new bin + pack object i and if end for