Using Python Language

you implemented various uninformed searching algorithms and returned traversal paths and exact paths for a given graph. Here, you will consider the same scenario and implement A searching algorithm, which is an informed search algorithm and return a traversal path and exact path of a given graph. Then, compare the cost from A* search algorithm with other uninformed search algorithms on the graphs (a) and (b) ( Heuristic functions: States hin) States h(n) S 6 S 14 A 7 B 3 B 10 3 4 D 1 D 2 G 0 E 4 G 0 Graph a Graph b 4