Problem 1 (20%) Search.

Consider the following graph. The start node is S, and the goal node is G. The step costs are labeled on the links, and the heuristic function values are given at the nodes. Find a solution path from S to G. Use alphabetical order as the tiebreaker.

1.a Use uniform-cost tree search algorithm. Give the list of nodes visited in order, the solution path, and the path cost of the solution. Show your work.

1.b Use greedy tree search algorithm. Give the list of nodes visited in order, the solution path, and the path cost of the solution. Show your work.

B 7h=10 h=2