Consider the following directed graph where $S$ is the start and $G$ is the goal, transition costs

are on arcs, and h is the heuristic estimate of distance to the goal.

A$.8$ points. Apply Greedy Best First Search to find a path from $S$ to G$.$ Fill out the following

table, showing the full contents of the priority queue at the start of each step $($before a node is

popped from the queue$).$ Show the final path and cost in the last line of the table. Write your

entries in this form:

$($ node $>$ priority: $$ priority $>,$ node $>$larr$$ parent $>)*$

Here, $*$ means $0$ or more entries of this form. For example,

$($D priority: $2,$DlarrA $)$

indicates D is the only node on the queue, its priority is $2,$ and $D$ was found from $A.$