Consider the following graph G. It consist of 9 nodes labeled with numbers as well as 12 edges connecting the nodes.
Each edge is labeled with its cost. Let 5 be the start node and 7 be the goal node. Run Depth-first search on G.
If the neighbors are visited in ascending order, how many nodes are in the path from start to goal?