Suppose you are acting as a consultant for the port authority of a small pacific rim nation. they are currently doing a multi-billion-dollar business per year, and their revenue is constrained almost entirely by the rate at which they can unload ships that arrive in the port. here is a basic sort of problem they face. a ship arrives with n containers of weight w1, w2, . . , wn. standing on the dock is a set of trucks, each of which can hold k units of weight. (you may assume that k and wi are integers.) you can stack multiple containers in each truck, subject to the weight restrictions of k. the goal is to minimize the number of trucks that are needed to carry all the containers. this problem is np-complete. a greedy algorithm you might use for this is the following. start with an empty truck and begin piling containers 1, 2, 3, . . into it until you get to a container that would overflow the weight limit. (these containers might not be sorted by weight.) now declare this truck “loaded” and send it off. then continue the process with a fresh truck. by considering trucks one at a time, this algorithm 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 for k where this algorithm does not use the minimum number of trucks.
(b) show that the number of trucks used by this algorithm is within a factor of two of the minimum possible number for any set of weights and any value of k.