Implement this problem using Python

Problem-02 (For Even ID Students): Consider the following graph. Find the most cost-effective path to reach from start state A to final state J using A* Algorithm. 10 A 3 6 7 2 8 B 3 2 3 8 5 5 3 Solution Hints: The numbers written on edges represent the distance between the nodes. The numbers written on nodes represent the heuristic value. Here, node A is the start state and node J is the goal state. For efficiency, you can skip backward ancestor if needed