This algorithm, by considering trucks one at a time, may not achieve the most efficient way to pack the full set of containers into an available collection of trucks. (a) give an example of a set of w

This algorithm, by considering trucks one at a time, may not achieve the most efficient way to pack the full set of containers into an available collection of trucks. (a) give an example of a set of weights, and a value of k, where this algorithm does not use the minimum possible number of trucks. (b) show, however, that the number of trucks used by this algorithm is within a factor of 2 of the minimum possible number, for any set of weights and any value of k.