2. (12 Points) Search algorithms in action: 3 Start B h=5 2 A h=2 5 4 h=2 2 D h=1 Goal 5 For each of the following graph search strategies, work out the order in which states are expanded as well as the path returned by graph search. In all cases, assume ties resolve in such a way that states with earlier alphabetical order are expanded first. The start and the goal state are S and G, respectively. Remember in graph search, a state is expanded only once. a. [2 points] Depth-first search b. [2 points] Breadth-first search C. [2 points] Uniform cost search. d. [3 points] Greedy search with heuristic h shown on the graph. e. [3 points] A* search with the same heuristic.