Question 2. [Show clear steps] Apply each of the following graph search strategies on the given graph. Show clear steps and the order in which states are expanded as well as the path returned by each strategy. Assume ties to be resolved in alphabetical order and a state is expanded only once. Also, assume the agent starts at S and wants to reach any of the goal state G. a) A* search b) Is the given heuristic admissible? Why? A 5 D 3 h=4 n=1 1 S h=6 3 3 G h=0 2 4 B h=3 2 h=3 [values inside the circles are heuristic costs to a goal state]