Time lett $135\mathrm{.}40$

Consider the following state space graph where the directed arcs represent the legal successors of a nade the cost of moving to a successor node is given by the number on the arc. The value of a heuristic function, $h,$ if computed at a state, is shown inside each node. The start state is $S$ and the goal is $G.$

What solution path is found by Greedy Best$-$First search?

write YOUR SOLUTION AS FOLLOWING:

ABCDE

Answe