I need python code for Uniform Cost Search (UCS) for the following graph. Requirements: 1. graph should be represented as a search tree; the start state is the root node, and children correspond to successors. To insert the graph use adjacency list. 2. Print the traversal path (list of all the node the algorithm visited before finding the goal node) 3. Print exact path (the minimum cost path that led to goal node) 5 A D 3 1 3 1 S 3 G 4 2 2 B Graph a