Consider the following graph. Explain why it is possible to find an Euler circuit for this graph. Then, using Fleury's algorithm, identify and draw an Euler circuit starting with point A and choosing the first edge as A to F. Show all work using the required method. Draw the graph properly. (If you choose not to draw on my graph, then draw a LARGE graph on your paper.)