3. Consider the following instance of the Knapsack problem with total capacity 10: Item 1 2 3 4 5 Value 5 2 8 3 10 Size 3 4 2 5 7 What is the optimal value of the solution, and what items can be chosen to obtain that value? Write out the dynamic programming table and show the backtracking process.