Answer
Using depth-first search to find a spanning tree of each of the given graphs.
Work Step by Step
a) A path of length 6
b) A path of length 5
c) A path of length 6
d) Depends on order chosen to visit the vertices; may be a path of length 7