question 4a

of the animals running off if left unattended. https://xkcd.com/1134/) (LINK: 4. (15 points) Consider the following graph and the associated table of heuristics for this graph. 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 broken in alphabetical order of the state label. For these problems assume that we have not expanded any nodes yet. 10 15 State Label Heuristic Cost (h) 19 16 19 16 14 a. Give the order of expansion of the first 10 nodes of a uniform cost search (not the best path - the order that the nodes are expanded) b. Give the order of expansion of the first 10 nodes of a greedy best first search. c. Give the order of expansion of the first 10 nodes of an A* search