Prove that, for a given set of boxes with specified weights, the greedy algorithm currently
in use actually minimizes the number of trucks that are needed. Your proof
should follow the type of analysis we used for the Interval Scheduling Problem: it
should establish the optimality of this greedy packing algorithm by identifying a measure
under which it “stays ahead” of all other solutions