Suppose we have an Internet web server, and we are presented with a collection of download requests each with a known size (an integer). Given this set of requests, we would like to determine a subset of them that totals in size exactly to the bandwidth of the server that can accommodate in one minute. Is the above problem a P or an NP-complete problem? If it is P, give a solution, if not identify a known NP-complete that describes this problem.