A thief is planning to rob a store. In the store, there are $4$ items with the following

weights and values:

Item $1$: Weight $=5kg,$ Value $=$$$10$

Item $2$: Weight $=3kg,$ Value $=$$$8$

Item $3$: Weight $=7kg,$ Value $=$$$15$

Item $4$: Weight $=2kg,$ Value $=$$$7$

The thief has a knapsack that can carry a maximum weight of $10$ kg $.$ Using the dynamic

programming approach for the $\frac{0}{1}$ Knapsack Problem, determine the maximum total

value the thief can steal and identify which items to take. Show the calculation process.