QUESTION Question: Given a set of integers a1,a2,...,an, determine if there is a way to partition the set in such a way that the sum of the values for each subset is the same. Provide a complete proof that the problem is NP-complete. Hint: use a reduction to Subset-Sum; make sure you have all the elements of the proof in place. you must provide an algorithm in pseudo-code, proof of correctness, and analysis of the running time together with any explanation you deem necessary