$14.$ What is an Eulerian circuit in a graph?

a$)$ A circuit with no edges

b$)$ A circuit that includes every vertex exactly once

c$)$ A circuit with no cycles

d$)$ A circuit with only one vertex