Implement A star search algorithm, in Python, using Google Colab; which can be used to find the optimal path between two nodes in a graph for the following graph: Start state as A and goal state J. The values on the edges indicate the cost of traversing the edge. The values beside the nodes represent its heuristic estimate.
3
6
F
6
1
7
2
5
8 B
H 3
D
3
1
1
2
3
1
8
c 5
5
5
3
E 3
5