Create a C++ program with algorithm.

Algorithm Best Fit For all object ; : 1, 2, 3 ..... n do For all bing j = 1, 2,... do if object i fits in bin ; then Calcolate remaining capacity after the object has been added | end if end for Pack object i in bin j, where ; is the bin with remaining Cupcity after adding the object (ie the object "fits best") If no such bin exis its open a new one and add the object end for. Best Fit Algorithm added For all object i: 1, 2, 3, .. ndo - For all bins j: 1, 2, .. do if object i fits in bin ; then Calcolate remaing capacity after the object has been end if end for Pack object &i in bin j, where is the bin with remaining capacity after adding the object If no such bin exists open a new one and add the object end for