Problem 1 (30 pts). The SUBSET SUM problem is defined as follows: given n non-negative integers w₁, W2, ..., wn and a no

[answerhappygod]

Problem 1 30 Pts The Subset Sum Problem Is Defined As Follows Given N Non Negative Integers W W2 Wn And A No 1 (24.83 KiB) Viewed 27 times

Problem 1 30 Pts The Subset Sum Problem Is Defined As Follows Given N Non Negative Integers W W2 Wn And A No 2 (20.04 KiB) Viewed 27 times

Problem 1 (30 pts). The SUBSET SUM problem is defined as follows: given n non-negative integers w₁, W2, ..., wn and a non-negative integer T, determine if there exists a subset I C {1,2,..., n} such that Σετ W; = T.

Question 1-1 (5 pts). Let's consider a SUBSET SUM problem where we have 6 non-negative integers 6, 3, 4, 2, 9, 6 and T=13. What is the decision (i.e., yes or no) and why?