Consider this Knapsack problem (without repetitions with 4 items, having weights and values as follows):

The weights (in pounds) are w₁ = 9, w₂ = 6, w₃ = 12, and w₄ = 2.

The dollar values of these items are, v₁ = 5, v₂ = 3, v₃ = 9, and v₄ = 3. The capacity of the knapsack is 13.

Consider running the dynamic programming algorithm for this problem on the above inputs. The algorithm fills in a table of entries K(w, j), where K(w, j) denotes the maximum value achievable using capacity at most w, if you are only allowed to use items 1 through j

Part 1:

When the algorithm computes K(13, 4), which two previously computed K(w, j) table entries does it access?

Part 2:

What is the maximum value that can be achieved for this problem? That is, what value will be assigned to table entry K(13, 4)?