Q$3)$ This question is concerned with dynamic programming. A bottom 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$=\{\backslash$alpha $\_1,\backslash$alpha $\_2,\backslash$alpha $\_3,\backslash$alpha $\_4,\backslash$alpha $\_5,\backslash$alpha $\_6\}$ can be summarised as following: The maximum weight constraint is $13.$ Using the following algorithm $($reproduced from the notes on Canvas$)$: SubserSums n$.$ W$)$: Let B$(0,$ w$)=0$ for each w in $\{0,...,$ w$\}$ for i$+1$ to n for w $0$ to w if w