Find an optimal solution for the $0/1$ knapsack problem. We consider n $($number of objects$)=7$ and W $($total weight$)=15.$ The solution must ensure that the total weight of the packed item is less than or equal to a given limit and the total profit value is as large as possible. The profits and weights of each object are as follows.$($p$1,$ p$2.($w$1,$ w$2......$ p$7)=(10,5,15,7,6,18,3)..$w$7)=(2,3,5,7,6,4,1)$