For the state space graph above, the node F is the start sta…
For the state space graph above, the node F is the start state and B is the goal state. An agent can move along states connected by edges in any direction (if X is connected to Y, the agent can move from X to Y and from Y to X), and edges are labeled with the cost to traverse them. What is the path returned by Uniform Cost Search (UCS)? Assume UCS uses alphabetical order to break ties in expansion priority and never expands the same node twice. In your final answer, list the nodes in the path returned by UCS. The first node must be the start state F and the last node must be the goal state B (e.g. Final answer: ). Please include partial calculations and/or explain your work for partial credit consideration.