Create a C++ program with the algorithm.

Algorithm First Fit Terrance Tao or all elements i 1,2,3,...in do for all bins j = 1,2,3.... do . I objects i fits in bin j then pack object i in bin j. Break the top and pack the next object end if end for object i did not fit in any availahe bin then create new bin and Puck object i end if end for. First fit Decreasing Sort objects in decreasing order using coming Apply first fit merge sort i 2