Describe the sequence of tracing from node S (start state) to node G (goal state) from the image below.

Using an algorithm:

A * search.

Note:

a). The function g (n) is the number of weights next to the edge (line), while the h (n) function is the number of weights in the node (circle). The function g (n) is a function of the distance between nodes, while the h (n) function is a function of the distance of a node to node G (goal).

b). In Depth First Search (DFS), if a node has many branch nodes, select it in alphabetical order.

h=8 A 20 6 3 3 h-6 h=4 h=1 2 $ B D h=6 h=0 4 3 6 c E h=5 h=2