Suppose you have an undirected graph with weighted edges, and perform a depth first search, such that the edges going out of each vertex are always explored in order by weight, smallest first. Is the depth first search tree resulting from this process guaranteed to be a minimum spanning tree? Explain why, if it is, or, if it isn't, provide a counterexample.