Use Fleury's Algorithm to Find an Euler Circuit for the Graph

Multiple Choice

Use Fleury's algorithm to find an Euler circuit for the graph beginning and ending at the indicated vertex. If no Euler
circuit exists, state this.
-Using the following graph, find an Euler circuit that begins and ends with vertex A.

A) $\mathrm{A} \rightarrow \mathrm{B} \rightarrow \mathrm{C} \rightarrow \mathrm{D} \rightarrow \mathrm{E} \rightarrow \mathrm{A} \rightarrow \mathrm{B}$
B) $\text { No Euler circuit exists. }$
C) $\mathrm{A} \rightarrow \mathrm{B} \rightarrow \mathrm{C} \rightarrow \mathrm{D} \rightarrow \mathrm{B} \rightarrow \mathrm{E} \rightarrow \mathrm{A}$
D) $A \rightarrow B \rightarrow C \rightarrow D \rightarrow B \rightarrow A$