import itertools

$$

def knapsack$($C$,$ W$,$ V$)$:

$$

$$ # Generate all possible combinations of items

$$ combinations $=$ list$($itertools$.$product$([0,1],$ repeat$=$len$($W$)))$

$$

$$ # Calculate the value and weight of each combination

$$ values $=[]$

$$ weights $=[]$

$$ for comb in combinations:

$$ value $=$ sum$([$V$[$i$]$ for i in range$($len$($W$))$ if comb$[$i$]==1])$

$$ weight $=$ sum$([$W$[$i$]$ for i in range$($len$($W$))$ if comb$[$i$]==1])$

$$ values.append$($value$)$

$$ weights.append$($weight$)$

$$# Find the combination with maximum value and weight under the knapsack capacity

$$ max$\_$value $=0$

$$ max$\_$weight $=0$

$$ max$\_$combination $=$ None

$$ for i in range$($len$($combinations$))$:

$$ if weights$[$i$]<=$ C and values$[$i$]>$ max$\_$value:

$$ max$\_$value $=$ values$[$i$]$

$$ max$\_$weight $=$ weights$[$i$]$

$$ max$\_$combination $=$ combinations$[$i$]$

$$

$$ # Create the list of picked items

$$ P $=[$int$($b$)$ for b in max$\_$combination$]$

$$

$$ return P$,$ max$\_$value, max$\_$weight

$$

# Test the function

C $=15$

W $=[11,2,1,4,1]$

V $=[4,2,1,10,2]$

P$,$ total$\_$value, total$\_$weight $=$ knapsack$($C$,$ W$,$ V$)$

print$("$Items Picked P $=",$ P$)$

print$("$Total value of picked items $=",$ total$\_$value$)$

print$("$Total weight of picked items $=",$ total$\_$weight$)$

$$

$$