Answer Happy

Let t V[i, j] denote the solution to the subproblem (i, j) of the Knapsack problem when using a bottom up dynamic programming approach, which considers the first items and a knapsack of capacity j. Suppose we want to compute V[6,12] using the previous entries in the dynamic programming table. Moreover, Item i = 6 has weight we = 8 and value 67. Select the correct statement below. O We need both V[5,12] and V[5,4] to compute V[6,12] and moreover, V[6,12] = max{V[5,12], 7+V[5,4]}. O We need both V[5,12] and V[5,5] to compute V[6,12] and moreover, V[6,12] = max{V[5,12], 8+V[5,5]}. O We only need V[5,12] to compute V[6,12] and moreover, V[6,12] = V[5,12]. O We only need V[5,12] to compute V[6,12] and moreover, V[6,12] = 7+V[5,12]. O None of the above is correct.