Consider the following state$-$space graph where the directed arcs represent the legal successors of a no cost of moving to a successor node is given by the number on the arc. The value of a heuristic function. computed at a state, is shown inside each node. The start state is $S$ and the goal is $G.$ Alphabetical ord

Trace the behavior of the IDFS algorithm? WIRIE THE FINAL PATH

write The SOLUTION PATH only

Answ