5. (20 points, written) The subset sum decision problem may be stated as follows: given a c Z" and BE Z, does there exists S C N = {1,2,...,n } such that Cai = B ies Given that subset sum is / 2-complete, show that binary knapsack decision problem (defined below) is Ny-complete as well. - Binary knapsack: Given w, c E Z", K, VEZ, is {xe {0, 1}" : wx V} # 0