Algorithms and Data Structures write the python code that finds on euler tour of given graph G (*if one exists*)following the fleurys algorithm

Problem 5: Euler Tour - An undirected graph G=(V,E) has Evlarian Tour if following two condlitons are true: 1. All vertices with non-zero degree are connected. We don't care about vertices with zero degree because they don't belong to Eulerian Cycle or Path. 2. All vertices have even degree. - Write the Python code that finds an Euller Tour of given graph G (ff one exists) following the Floury's Algorithm: 1. Make sure the graph has either 0 or 2 odd vertices. 2. If there are 0 odd vertices, start anywhere. If there are 2 odd vertices, start at one of them. 3. Follow edges one at a time. If you have a choice between a bridge and a non-bridge, always choose the non-bridge. 4. Stop when yourun out of edges. Input: Adjacency list representation of the graph G Output: The graph has an Buler Tour / The graph has no Euler Tour