$4.\text{'}(20\%)$ Using dynamic programming and$/$or greedy technique, solve the knapsack problem with items in the following table and the capacity of the knapsack is $5$ lb$.$ Show your steps briefly, $1)$ If objects can be taken as fractions, what is the best choice? Justify your answer. $2)$ If objects cannot be taken as fractions, complete the following table T to get the best choice. You may only show calculations of T $[3,3]$ and T$[4,5].$ No need to show other calculations.