state space: {S, A, B, G operators: 01 maps S to A with cost 4, O2 maps S to B with cost 2, Os maps B to A with cost 1, and O4 maps from A to G with cost 5 initial state S; . goal state G . heuristic function h: h(S) = 7, h(A)-1, h(B) = 6, and h(G) = 0 Find a solution using A search (either by tree or by graph). Number the nodes according to their order of expansion, and for each node give itsf(n)g() + h(n) value