Suppose that you need to find a path between S and G in the following graph. The number attached to each edge in the graph represents the actual cost of traversing the edge. Node Heuristic dist. To G i. ii. iii. iv. V. 7 S 8 Z 2 S 10 F A 5 C 4 Depth First Search Breadth First Search Uniform Cost Search Greedy Best First Search A* search 3 D Assume also that the heuristic distances to the goal from each node are given by the following table: 2 D 3 3 5 5 H F G goal 4 For each of the following search methods, list the nodes in the order in which they are expanded by the search method while looking for a solution. Show your work. When everything else is equal, order the nodes in alphabetical order. (20 points) G 0 H 2