'For the following graph, run (iterate the algorithm by hand) iterative deepening tree search and list the 1) states of the first 5 search nodes in the order they would expand 2) states of the search nodes that lie along the solution path to the goal and 3) the path cost.
Consider the following graph
Consider the following graph with start state S and goal state D The numbers on the arcs indicate the cost of traversing that arc 2
S
2
F'