Answer all the questions and sub questions below. Make sure the answer is correct. Copying from other chegg answers is a thumbs down since they are wrong. Thank you, thumbs up for a good answer with organized explanation.

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.) (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: (2). Is the search heuristic h used in the problem above admissible? Explain your answer. Yes / No. Because: (3). Is the search heuristic h used in the problem above consistent? Explain your answer. Yes / No. Because