pls give answer in 20 min pls

Find the best solution to the 0/1 Knapsack instance where there are 5 things and 13 slots in the bag. Below are the profit values and their weights. (P1, P2,P5)=(10,5,13,3,6)(W1,W2,W5)=(2,3,5,4,6). Utilize dynamic programming to discover the best answer. Prepare the table, trace the algorithm, and derive the recursive definition