23. Suppose you can only choose to take or leave cach entire item. Let V[i]U] denote the highest total value you can obtain with items 1~i and a knapsack of weight capacity j. Which of the following recurrence relations is correct? (A) V[i][j] = max(V[i - 1][j]，V[i - 1][j -1] +v[i]) (B) V[i][j]=max(V[i - 1][j]，V[i - 1][j -w[i])+v[i]) (C) V[i][j] = max(V[i][j - 1]，V[i -1] [j-1] +v[i]) (D)V[i][j]= max(V[i][j-w[i]]，V[i -1][j-w[i]]+ v[1])