Consider the search space below, where S is the start node and G1 and G2 are goal nodes. Edges are labeled with the value of a cost function and nodes are labeled with the value of a heuristic function (the number gives the estimate of the distance to the goal). Assume that uninformed search algorithms always choose the left branch first when there is a choice.

For each of the following search strategies, find, 1. which goal state is reached first (if any) 2. list the order of visited nodes in your solution

- Depth-first search

- Breadth-first search

- Greedy search

- A* search

S 5 3 2 B 1 1 A 2 3 4 1 1 G1 un 5 9 D 1 8 2 G2 F 6 7