07: 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 "O/1Knapsack Problem", to be suitable for solving Unbounded Knapsack Problem. b) Using rules found in (A), find the solution for the following date, if the $w=8$ (max weight). \begin{tabular}{[1]c[cc]} \hline Item # & 1 & 2 & 3 \hline # of available instance & 3 & 2 & 2 \hline Item weight & 2 & 3 & 3 \hline Item benefit & 3 & 5 & 8 W \hline \end{tabular} CS.VS. 1055