**Part 1**

- Design
*a greedy algorithm*using pseudocode that solves this optimization problem of transferring files to disk while minimizing unused storage. The inputs to this algorithm are the number of files*n*, corresponding sizes (in MBs)*s1, ... sn*,*m*the number of disks, and corresponding storages amounts*t1, ..., tm*. The algorithm should return an array*map[i]*which contains the disk index of which the ith media file should be stored. - Comment your pseudocode for increased readability.

**Part 2**

- Discuss the optimality of your algorithm. Is it guaranteed to return an optimal result?
- What is the Big-O time complexity of this algorithm in terms of
*m*and*n*? Justify your answer.

**Part 3**

- If you were to solve this problem using a brute force or exhaustive search method, what would be the time complexity? Justify your response.

### Recently Asked Questions

- An increase in productivity will cause which of the following according to the price-setting behavior of firms ?

- Please refer to the attachment to answer this question. This question was created from Chapter 17 Ratios, common-size statements, and trend percents.

- Which of the following is most likely to reduce the natural rate of unemployment ?