This question is concerned with dynamic programming. A bollom-up dynamic programming method is to be used...

 

Transcribed Image Text:

This question is concerned with dynamic programming. A bollom-up dynamic programming method is to be used to solve the subset sum problem. The problem is to find the optimal sum of weighted requests from a set of requests A subject to a weight constraint W. The set of weighted requests A = {a.az.a.s.s.) can be summarised as following: Request a aty as for w+ 0 to W (75 (6 The maximum weight constraint is 13. Using the following algorithm (reproduced from the notes on Canvas): 3 1 3 5 2 3 SubsetSum(n. W): Let B(0,w) 0 for each we (0.....W) for i=1 to n if w This question is concerned with dynamic programming. A bollom-up dynamic programming method is to be used to solve the subset sum problem. The problem is to find the optimal sum of weighted requests from a set of requests A subject to a weight constraint W. The set of weighted requests A = {a.az.a.s.s.) can be summarised as following: Request a aty as for w+ 0 to W (75 (6 The maximum weight constraint is 13. Using the following algorithm (reproduced from the notes on Canvas): 3 1 3 5 2 3 SubsetSum(n. W): Let B(0,w) 0 for each we (0.....W) for i=1 to n if w