$(3$ points$).$ Knapsack problem considering only full $($not fractional$)$ objects:$$

We have $3$ objects in the Knapsack with the following weights and values, respectively:$$

$$

The capacity of the knapsack is W $=12.$

$$

Which algorithm design strategy would you recommend for this problem?$$

Would a greedy strategy for this Knapsack problem lead to the highest value of the knapsack? Justify your answer.$$