69. Two spanning trees of a (weighted) graph are considered different if they use different edges. Show that the following graph has different minimum-cost spanning trees, though all these different trees have the same cost.