Consider the Dynamic Programming Algorithm for the Binary Knapsack Problem in Lecture $7.$

Let there be $4$ items, W $=10,$ values $=[2435]$ and volumes $=[3286].$

What is V$[3,7]?$

a$.$

$8+$ V$[2,4]$

b$.$

$0$

c$.$

$3+$ V$[2,7]$

d$.$

V$[2,7]$