Given a graph G assume it has 2 edge-disjoint minimally spanning trees S and T. If a is the smallest edge weight in S, then prove/show that there will be at least 2 edges wi
