Question 1: Single choice
mediumAI-checkedSearch & PlanningA graph is given by its MoveGen function, which lists the neighbours of each node in order:
| Node | MoveGen |
|---|---|
| S | A, B |
| A | C, S |
| B | D, S |
| C | E, D, A |
| D | C, E, B, G |
| E | C, D, G |
| G | D, E |
Depth-first search starts at S with goal G. OPEN is a stack: the new neighbours are put on top in MoveGen order, so the first one is picked next. A node already on OPEN or CLOSED is not added again, and the goal test is applied when a node is picked from OPEN. Which path does the search return?