A* Search: 1. Consider the search problem below with start state S and goal state G. The transition costs are next to the edges, and the heuristic values are next to the states. h=8 A 20 3 h=6 h=4 h=1 2 2 5 1 S B A F h=6 6 4 1 3 h=5 2 6 E What is the final path for this A * search? 1/2 h=2 h=0 Game Tree: The figure below is the game tree of a two-player game; the first player is the max and the second player is the min. • . Min Max Max What is the final value of this game? Я Show where alpha-beta pruning occurs, along with the final alpha-beta range values for each node that is searched.