1) Use the backtracking algorithm, state space tree and a promising function to find all combinations of the following numbers that sum to W =52: w1 =10 w2=13 w3=17 w4 =22 w5 =42 a) Form the state space tree (15 points) b) Describe the heuristic that can be used in the promising function (5 points) c) Step by step find/show the solution(s) using the state space tree and your heuristics (15 points)