資料結構與演算法

(5 points) Consider a knapsack with capacity 17 and five types of items, each with its size and value listed below. All items are available in unlimited quantities and each item can be selected more than once. The goal is to maximize the total value of the items placed in the knapsack. If the maximum value of the knapsack is $10a + b$ where $a$ and $b$ are integers in $\{0, 1, 2, \dots, 9\}$, what is the value of $a + b$?