State the brute force Knapsack. Find an optimal solution to the Knapsack instance n$=4,$

m$=16,($v$1,$v$2,$v$3,$v$4)=(20,30,50,10)$ and $($W$1,$W$2,$W$3,$W$4)=(2,5,10,5).$