Problem definition: Use the backtracking algorithm to solve the subset sum

problem, $n=6,w_1=3,w_2=34,w_3=4,w_4=12,w_5=5,w_6=2,M=9$

Step$1$: Based on Pseudocode in slide $20,$ implement the algorith

$m$

Step$2$: Run the algorithm and get the solution using given input

Step$3$: Draw the pruned state tree, and compare and discuss the

result to the one we got in step $2.$

$-$ Write the pseudo$-$code

$-$ Source code$($python$)$