Consider a search space defined by the table, which gives the cost of arcs between pairs of nodes. Node S is the start state and node G the goal. From To Cost S B 3 S C 2 Node h S D 4 B 4 B E 3 E 5 D F 1 E Z 2 a. Draw the complete graph of the state space, mark cost in the arc (or the edge) b. What path is the cheapest solution and what is its cost just by checking all possible routes? c. Using graph search with an evaluation function of f(n) = g(n), where g(n) is the cost of the cheapest known path from the start node to n. For example, g(B) = 3, g(E)= 3+3 = 6, etc. Mark them in the graph. Some node may have several g values based on its route. In what order would the nodes in the graph be expanded? d. Repeat this exercise using the selection function f(n) = -g(n). For example, f(B) = -3, F(E)=-6. e. Assuming heuristic function h(n) given by the table F Z 4 S D E F Z G 8 6 6 3 6 3 0 show the order that the nodes would be expanded if the evaluation function is f(n) = g(n) + h(n). Z G 4