13. Use Fleury's Algorithm to find an Euler path in the graph below. Clearly indicate where you start and end your path as well as label each edge of the graph 1, 2, 3, 4, etc as you travel through the edges. The use of colored pencils and tracing paper is recommended. H Starting vertex Rationale Ending vertex Rationale G 14. Find an optimal eulerization for the graph below. Use the minimum number of edges possible and CLEARLY indicate the edges you are adding by the use of colored pencils. How many edges were added?.