MS $($TE $0102)$ 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]?$ Select one: a$\mathrm{.}3+$ V$[2,7]$ b$.$o c$.$V$[2,7]$ d$\mathrm{.}8+$ V$[2,4]$ Next