Consider the same maze shown above with the same start and goal nodes. Let the heuristic cost ofConsider navigating the maze shown below.

The maze is represented as a graph with edge costs as shown on the edges. The edge cost is $1$ for all

edges where the cost is not shown. Let $S$ be the initial state and $G$ be the goal state.

List the first $8$ vertices expanded by Uniform Cost Search $($enter the single letter label of a node$).$

S

A

Note:

You must use the algorithm shown in class and in the PPT$.$

A node is "expanded" when it is taken out of the frontier and its children are inserted

Child states of a state are generated in alphabetical order. If two nodes in the priority queue have

the same priority, the node that appears earlier in alphabetical order is in front.

answer these and i will give you a thumbs up