Using Greedy Best$-$First Search, find the path from $S$ to $G$ in the following graph.

Keep track of the visited list and the frontier at each iteration.

Show the order of node expansion.

Include the value of $f(n)$ for each node in the frontier.

We recommend using a table similar to the sample shown below:

List the path found by the algorithm.

What is the cost of the path?

Is the path found by the algorithm optimal?