A high accounts center wants to store a certain number of files on a limited amount of memory W Bit . These files contain data resulting from very complex calculations. Each of these files has a certain size and requires a certain time to calculate it. The storage process aims at avoiding the need to recalculate by storing a minimum number of n files so that:
1. Total files stored are smaller or equal to W.
2. Total time to calculate the files stored as the greatest.
Part of a file can not be stored, but total of the file or none of it.
Required:
1. Identify an appropriate data structure to resolve this issue.
2. Explain the size of the potential space for this issue.
3. Type the outline of the backtracking algorithm that will solve this issue with the discussion.