Answer Happy

I need this befor 4:40
b) Find the order of expansion of nodes and the path from start node to goal node for the following graph by using Uniform cost search (UCS). Assume start node to be a and goal node to be z. The values indicated along the connecting lines represent step costs or transition costs and values indicated close to the nodes represent respective heuristic values. Heuristic value for goal node is zero. 5 b 10 6 5 8 8 1 8 N 2 N a a 11 5 10 2 c.). Consider the graph given below. Assume that A is the initial state and I is the goal state. Using A* Search, find the path and total path cost from the initial state to the goal state. Also mention the draw back of A* Search with an Example. A* Search Start 75 118 State A B 140 B 111 80 С D E Heuristic: h(n) 366 374 329 244 253 178 193 98 0 F G 97 H 105 211 H 1 Goal