Write C functions to analyze the $0/1$ Knapsack Problem thus by implementing using Dynamic Programming$($ set method $)$

Given that n$=6,$

$($P$1,$P$2,$P$3,$P$4,$P$5)=($W$1,$W$2,$W$3,$W$4,$W$5)=(7,4,3,5,2,9)$ and m$=15$

Write $C$ functions to analyze the $\frac{0}{1}$ Knapsack Problem thus by implementing using Dynamic

Programming$($ set method $)$

Given that $n=5,$

$(P1,P2,P3,P4,P5)=(W1,W2,W3,W4,W5)=(7,4,3,5,2,9)$ and $m=15$

Note : profit is same as the weight of each item

For example:Note : profit is same as the weight of each item $($In the Result: $0$ indicates the object has not been selected and $1$ indicates the object has been selected according to their respective indexes$)$ The result must be same as shown in the image for the corresponding input.