1. ]. Figure 6 shows a state graph with five states. Assume that “a” is the initial state, and “G” is the goal state. The value above each line shows the arch cost.
2. Use Uniform Cost Search (UCS) to build a search tree to carry out search from the initial state to the goal state (Show complete search tree).
3. Mark order of the search node (on the search tree) being visited from initiate state to find the goal state (break tie in favor of node with a lower alphabetic order, e.g., “b” has a higher priority than “c”. ). If multiple nodes are created for same state, say “f”, use f1, f2, f3, etc., to denote each node (the number corresponding to node being created). [1 pt]
4. Show final path from “a” to the goal state. Is the solution optimal? Why or why not? [1 pt]
5.  

1 5 3 G 5