Inspired by the iterative deepening algorithm, you decide to design an iterative broadening algorithm. The idea is to start with 2 children and do depth-first search limiting the expansion of each node to 2 children. 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. What advantages do you see in this algorithm? What shortcomings do you see in this algorithm?|