(b) The solid edges of the graph G shown below form a spanning tree T of G. The edge- weights of T are w(a, f)-5, w(b,f-2, w(c, f)-2, w(d, e)-1, and we, f) 3. Determine the minimum possible weights of the edges (a, b), (c, d), and (c,e) if T is a minimum spanning tree of G. (2 points) 2 2