professor bin is attempting to load bags into the trunk of her car and seeks to load as many bags as possible. the bags are of various sizes (and are infinitely flexible, while maintaining the same volume). she plans to use a greedy algorithm to solve this problem. (a) state the greedy algorithm for this problem (b) does this problem have the greedy-choice property? why or why not? (c) does this problem have the optimal substructure property? why or why not? (d) would there be a greedy solution if instead of optimizing the number of boxes, she instead seeks to fill the largest possible fraction of the space in the trunk? why or why not?