1. Consider the search tree below. The initial state is at the top, and the goal states are G and I, represented by the double-bordered rectangles. (Note that this is a search tree. The edges are directed, with ununiformed weights.) A, h=3 B, h=4 D, h=10 h= 2 F, h=0 G, h=0 H, h=2 (1). For each of the search strategies listed below, give a chronologically ordered list of the nodes visited (including the final goal node) Breadth first search: Depth first search: Iterative deepening: Best first search: A* search: IDA* search: 1. Consider the search tree below. The initial state is at the top, and the goal states are G and I, represented by the double-bordered rectangles. (Note that this is a search tree. The edges are directed, with ununiformed weights.) A, h=3 B, h=4 D, h=10 h= 2 F, h=0 G, h=0 H, h=2 (1). For each of the search strategies listed below, give a chronologically ordered list of the nodes visited (including the final goal node) Breadth first search: Depth first search: Iterative deepening: Best first search: A* search: IDA* search