onsider A* graph search on the graph below. Arcs are labeled with action costs and states are labeled with
heuristic values. Assume that ties are broken alphabetically (so a partial plan S->X->A would be expanded before S-
>X->B and S->A->Z would be expanded before S->B->A.
1.1
In what order are states expanded by A* graph search? Show the details steps.
1.2
What path does A* graph search return? Show details