Question 6 10 points Save Answer Consider the knapsack problem solved by the Dynamic Programming. Consider the following weights w1=2, w2=1, w3=3, w4=2 and corresponding values of v1= 3, v2= 1, v3 = 2, v4 = 4, with maximum capacity of W=5. Let F(i, j) be the value of the most valuable subset of the first i items that fits into knapsack of capacity j. How is F(2, 4) evaluated? F( 2, 4) = mix{ F(4, 1), F(3, 1) + 2} F(2, 4) = F(1, 4) F(2, 4) = F( 1, 3) + 1 F(2, 4) = max{ F(1, 4), F(1, 3)+1}