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

Given that n$=5,$

$($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$

Note : profit is same as the weight of each item

For example:

input:

$6$

$15$

$743529$

$743529$

output:$010011$

$101100$