Consider the situation where you want to load n files of size s1, s2, . . . , sn into a computer memory of size S.

Unfortunately, it is not possible to simultaneously load all files into memory as Pn i=1 si > S. Therefore, you need to select a subset of the files to load such that Pk i=1 si ? S (where k < n).

Assume that the files are sorted by non-decreasing size si ? . . . ? sn.

Does a greedy algorithm that selects files in order of non-decreasing si maximize the number of files stored in the memory? If you answer yes, provide a brief explanation. If you answer no, give a counter-example.

and

Does a greedy algorithm that selects files in order of non-decreasing si use as much of the memory capacity as possible? If you answer yes, provide a brief explanation. If you answer no, give a counter-example.

Please keep your explanations concise