1. Answer the following

Given the following undirected, weighted graph, representing a state space. Here each node in the graph represents a state, and the weight w on an edge (u, v) indicates the cost of going from stateu to state v (and it is also the cost from state v to state u). Let state A be the initial state and state G be the goal state. The heuristic function h (which is admissible) is defined by the following table: h(A) 11 h(B) 7 h(C) 7 h(D) 4 h(E) 6 h(G) 0 Trace the A algorithm using tree search for finding the optimal path from A to G 4 4 3 TCO 2 3