Fоr the stаte spаce grаph abоve, wоrk out the order in which states are expanded and the path returned by BFS with complete memory of previously expanded nodes (i.e. nodes cannot be expanded twice). Arcs are labeled with the cost of traversing them and the estimated cost to a goal (heuristic function) is reported inside nodes. The node S is the start state and G1, G2 and G3 are goal states. Assume ties resolve in such a way that states with earlier alphabetical order are expanded first. List the expanded nodes in the order that they are expanded. The first node must be S and the last node must be the first expanded goal state (e.g. {S, A, G1}).