Give a spanning tree for this graph.

Consider the following undirected graph.
vertices: A, B, C, D, E
edges: (A,B),(C,D), (B,D), (B,C), (C,E), (D,E)

One spanning tree for this graph is the edges (A,B),(B,D),(B,C),(D,E).