Fleury’s Algorithm: Path A-B-G-H-C-J-E-H-B-C-D-E-F-G-A is a Eulercircuit.Euler’s Theorem 1:• Two vertices of graph (b) haveodd degree.Therefore it has no Eulercircuit.Euler’s Theorem 2:• Vertices with odd degree is >2. Therefore ithas a Euler path• The graph is connected and has just twovertices of odd degree, therefore it has at leastone Euler pathEuler’s Theorem 3:Fleury’s Algorithm:The path E-F-G-H-L-G-C-H-M-L-K-F-B-EK-J-E-A-B-C-D-H is a Euler circuit.3. A businessman has to visit five cities A, B, C, D and E. The