You are given the following graph, where each node has an identifier $($a letter$),$ and an h value which is the estimated distance from the node to the goal.

A number along an arc indicates the cost of the arc. A is the initial node and G is the goal node.

In what order does Greedy Best$-$First Search expand nodes from A to G $($or in other words, in what order do the nodes exit the frontier$),$ and what is the solution path found?

Order of expanded nodes: A C G

Solution path: A$-$C$-$G

Order of expanded nodes: A B E G

Solution path: A$-$B$-$E$-$G

Order of expanded nodes: A D F G

Solution path: A$-$D$-$F$-$G

Order of expanded nodes: A B C G

Solution path: A$-$C$-$G