Consider the graph below with six states. The successors of each node are indicated by the arrows out of that node. Step costs are given next to each edge. Heuristic values are given next to each node (as h = x). For each search strategy below, show the order in which nodes are expanded, with S as the start state and G as the goal state. Please end your paths with the goal node that is found, if any, even if it's not expanded. Also, show the path from start to goal and its cost, or write "None" if no path is found. Assume the successor function returns states in alphabetic order, e.g. the children of Sare (A, B) and the children of A are (A, D), in that order. 20 . 8 h = 4 20 9 S D G h = 15 9 h = 7 h=0 1 B h = 10 h=7 Answer the following 3 parts for each search algorithm Order of expansion of the nodes Path found Cost of the path found (Greedy) Best-First Search with f(N) = h(N) A* Search Consider the graph below with six states. The successors of each node are indicated by the arrows out of that node. Step costs are given next to each edge. Heuristic values are given next to each node (as h = x). For each search strategy below, show the order in which nodes are expanded, with S as the start state and G as the goal state. Please end your paths with the goal node that is found, if any, even if it's not expanded. Also, show the path from start to goal and its cost, or write "None" if no path is found. Assume the successor function returns states in alphabetic order, e.g. the children of Sare (A, B) and the children of A are (A, D), in that order. 20 . 8 h = 4 20 9 S D G h = 15 9 h = 7 h=0 1 B h = 10 h=7 Answer the following 3 parts for each search algorithm Order of expansion of the nodes Path found Cost of the path found (Greedy) Best-First Search with f(N) = h(N) A* Search