Inspired by the iterative deepening algorithm, you decide to design an "iterative broadening algorithm". The idea is to start with 2 children and do a depth-first search limiting at each node expansion the number of children to 2. If you fail to find a solution, you restart the search from the beginning increasing the number of children by 1. Repeat this process until you find a solution.

1. What advantages, if any, do you see in this algorithm? What shortcomings?
2. For what type of search spaces do you think this algorithm will be useful?