3. The bin packing problem is to pack the objects of various weights into containers. Assume that cach container can hold a maximum of 10 poumds. The program uses an algorithm that places an object with the largest weight into the first bin in which it would fit. Your program should prompt the user to enter the total number of objects and the weight of each object. The program displays the total number of containers needed to pack the objects and the contents of cach container. Here is a sample fun of the program: Coutpur Enter the number of objects about itinerary with the following members: 1. A data field named flgihts of the Listeflight> type. The list contains the flights for the itinerary in increasing order of departure Time. A constructor that creat: 6 Enter the weights of the objects: 752358 Container 1 contains objects with weight 82 Container 2 contains objects with weight 73 Container 3 contains objects with weight 55 cend outpuip Does this program produce an optimal solution, that is. finding the minimum number of containers to pack the objects? Does the algorithm always find the optimal solution