**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

- 1.Escribe la forma correcta del verbo en el espacio. Solo escribe la forma del verbo que falta. Nosotros esperamos que el grupo ______ a nosotros. (seguir) 2.

- Which of the following is not a mechanism for microsatellite repeat length differences?

- What is the return on equity if sales are $290,000, net income is $49,000 and average common Stockholders' Equity is $188,000? What is the