(Solved): solve completely and accurately all parts Use the A* search algorithm to find optimal path to t ...

solve completely and accurately all parts

Use the A* search algorithm to find optimal path to the problem. The numbers written on edges represent the distance between the nodes. The numbers written on nodes represent the heuristic valuc. Find the most costeffective path to reach from start state $\mathbf{A}$ to final state J. Cnleulate the sequence of nodes that the algorithm will consider and the $f(n),g(n)$, and $h(n)$ score for each node.