Which nontrivial connected graphs G have closed spanning walks that contain every edge of G exactly three times?
a) Trees
b) Cycles
c) Complete graphs
d) Bipartite graphs