Please provide code in python

Using Python Consider the following two graphs to test your algorithms: 5 A 3 3 s 3 4 s 3 2 2 10 B E 6 Graph a Graph b Your task is to implement A* searching algorithm, which is an informed search algorithm and return a traversal path (every path the algorithm tried before reaching to the lowest cost path) and exact path (the lowest cost path) of the given graphs. Display the cost of the exact path. Heuristic functions: States S A h(n) 6 4 B 3 3 States hin) S 14 A 7 B 10 4 D 2 E 4 G 0 Graph b D G 1 0 Graph a