Q7: Unbounded Knapsack Problem is a modified version of "0/1Knapsack Problem", where multiple instances of the same item can be selected. (10 points) a) Modify the rules of Dynamic programming for " $0 / \mathbf{1} \mathbf{K na psac k} $ Problem", to be suitable for solving Unbounded Knapsack Problem. b) Using rules and in (A), find the solution for the following $\mathrm{d} a$, if the $\mathrm{W}=8$ (max weight). \begin{tabular}{|1||CC|} \hline Item # & 1 & 2 & 3 W \hline # of available instance & 3 & 2 & 2 Thline Item weight & & 3 & 3 \hline Item benefit & 9 & 2 & 8 W \hline \end{tabular} CS.VS. 1149