Use the first-fit decreasing method to pack these weights, in kg, into bags that can each hold a maximum of 10 kg .
$$\begin{array} { l l l l l l l l l l }
2 & 7 & 5 & 3 & 3 & 4 & 3 & 2 & 8 & 3
\end{array}$$
Find a packing that uses fewer bags.
The order of a particular algorithm is a cubic function of the number of input values. It takes 4 seconds for the algorithm to process 100 input values. Approximately how many seconds will it take the algorithm to process 500 input values?