Consider the following table of heuristics: The search starts with the node associated with the state labelled \"A\" and the goal state for this graph is the state labelled \"I\". Assume that in the case of ties, ties are borken in alphabetical order of the state label. For these problems assume that we have not expanded any nodes yet. Give the order of expansion of the first 10 nodes of a greedy best first search Give the order of expansion of the first 10 nodes of an A* search 4 4 10 15 Solution bfs: AFH BCG EFI .

1. Consider the following table of heuristics:
The search starts with the node associated with the state labelled "A" and the goal state for this
graph is the state labelled "I". Assume that in the case of ties, ties are borken in alphabetical
order of the state label. For these problems assume that we have not expanded any nodes yet.
Give the order of expansion of the first 10 nodes of a greedy best first search
Give the order of expansion of the first 10 nodes of an A* search
State Label Heuristic Cost (h)
A 19
B 16
C 19
D 16
E 14
F 9
G 6
H 3
I 0
4 4 10 15
Solution
bfs: AFH BCG EFI