Part 1

• I need to designa greedy algorithmusing pseudocode that will solves a optimization problem of transferring files to a disk while minimizing unused storage. I need the inputs of the algorithm to be the number of filesn, that corresponds the sizes (in MBs)s1, sn,mthe number of disks, and corresponding storages amountst1, tm. The algorithm should return an arraymap[i]and contain the disk index of which the ithmedia file should be stored.
• Then I need to comment my pseudocode for increased readability.

Part 2

• in this part I need to example the optimality of the algorithm. And answer the question to guarantee the return an optimal result.
• find the Big-O time complexity of the algorithm in terms ofmandn. And Justify my answer.

Part 3

I need to solve the problem as a brute force or exhaustive search method, find the time complexity. And Justify my response.