Suppose you have n photos (P1, P2, ... , Pn) that you want to store in a USB drive. Photo Pi

requires mi

megabytes of space. The capacity of the USB drive is C megabytes, where C < mi mi n i=1 a) Is it possible for a greedy algorithm that selects photos in order of increasing mi

to maximize the

number of photos you can save on the drive? If yes, explain why, otherwise give a counterexample.

b) Is it possible for a greedy algorithm that selects photos in order of decreasing mi

to maximize the amount of space used on the drive? If yes, prove it, otherwise give a counterexample.