possible K A graph is given to the right. a. Explain why the graph has at least one Euler circuit. b. Use trial and error or Fleury's Algorithm to find one such circuit. C E a. Choose the correct explanation below. O A. It has exactly two odd vertices. O B. It has no odd vertices. O C. It has no even vertices. O D. All graphs have at least one Euler circuit. b. Write an Euler circuit starting at A. (Use a comma to separate vertices as needed.)