Consider the search graph below, where S is the start node and G1, G2, and G3 are goal states. Arcs are labeled with the cost of traversing them and the heuristic cost to a goal is shown inside the nodes.
1. Apply the unweighted shortest paths technique to find the order of states expanded using the Breadth First Search. Write down the states expanded to reach each of the Goal states.
2. Apply the A* Search algorithm to completely analyze the problem for the best goal state. (You are required to solve the problem for all the goal states and provide the optimal path and cost for reaching each of the states).