Let $G$ be a connected graph.
Clearly a tree is its own spanning tree:
Creation of a Spanning Tree
There are two ways of creating a spanning tree for a given graph $G$:
Continue till all vertices are included.
Start with the graph $G$.
Repeat this procedure till no cycles are left in $G$.