Consider the following undirected graph.

vertices: A$,$ B$,$ C$,$ D$,$ E

edges: $($A$,$B$),($A$,$C$),($B$,$C$),($B$,$D$),($C$,$D$),($D$,$E$)$

Give a spanning tree for this graph by using edges.

$($Hint: there are multiple options$)$

$-($A$,$B$),($A$,$C$),($B$,$C$),($B$,$D$),($C$,$D$),($D$,$E$)$

$-($A$,$B$),($B$,$D$),($D$,$E$),($B$,$C$)$

$-($A$,$B$),($B$,$D$),($D$,$E$),($C$,$D$)$

$-($A$,$C$),($C$,$D$),($D$,$E$),($B$,$C$)$

$-($A$,$B$),($A$,$C$),($B$,$D$),($D$,$E$)$