Use the Backtracking algorithm for the Sum-of-Subsets problem (Algorithm 5.4) to find all combinations of the following numbers that sum to W = 52:

W1 = 2

W2 = 10

W3 = 13

W4 = 17

W5 = 22

W6 = 42

Identify the size of the search space (including the root node).

Identify the two solutions.

Draw a state space through that includes weights w₁, w₂. w₃, and w₄.

Given that n = 6 and a tree with a depth of 7, including the root node, what is the minimum depth at which backtracking might first occur.