Use the following tree to indicate the order that nodes are expanded, for different types of search. Assume that A is the start node and G is the only goal node. Here, the step costs are shown to the...

Use the following tree to indicate the order that nodes are expanded, for different types of search. Assume that A is the start node and G is the only goal node. Here, the step costs are shown to the right of each edge (step). Moreover, for each node, g = cost of path so far, h = estimate of remaining cost to goal, f = estimate of total path cost are shown to the right.