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 h2 returns.

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

Local search algorithms always maintain the same number of states in every iteration.

Iterative deepening search needs more memory than breadth first search.

Which of the following search methods has the lowest space complexity (worst-case)?

The pseudo-code presented in the figure below corresponds to which search algorithm?

The pseudo-code presented in the figure below corresponds to which search algorithm?