You just found out that your laptop will self-destruct imminently, and need to copy n sensitive files to k 1GB flash drives. Given the file sizes of your n files, you would like to know whether or not you can copy all n files to your k flash drives without splitting any file into pieces. Show that this problem is NP-complete by reduction from PARTITION = { | A is an array of positive integers which can be divided exactly in two, i.e., shuffled so that after shuffling one has A[1]+...+A[i] = A[i+1]+...+A[end] for some i}, which is a known NP-complete problem.