Consider the search graph shown bellow. S is the start state and G is the goal state. Edges are annotated with their cost. The table shows the values for each node for three different heuristic functions: h1, h2 and h3.

• Specify the path as a sequence of nodes, starting at S and ending at G, that the Greedy Best First search algorithm with heuristic h3 returns.

• The path should be written in the format: S, ?, ?, ..., G