1. Suppose that in a particular problem, there are 100 elements in U; there are 50 sets in W; each set in W has exactly 20 elements; and each element in U is covered by exactly 10 sets in W. Thus, a solution to the problem must consist of exactly 5 sets in W (100 elements total divided by 20 elements per set). What is the branching factor in the state space? What is the depth of the state space? Give an upper bound on the size of the state space.

2. Suppose that in a particular problem, there are 100 elements in U; there are 50 sets in W; each set in W has between 10 and 20 elements; and each element in U is covered by between 5 and 10 sets in W. Thus, a solution to the problem contains somewhere between 5 (=100/20) and 10 (=100/10) sets in W. Might it be worthwhile using iterative deepening for this problem rather than depth-first search? Explain your answe