(c) The wheel graph Wn is a graph on n 1 vertices and 2n edges, formed as follows: take a cycle graph Cn, and add a "center" vertex connected to every vertex in Cn. Several examples are drawn at right. Come up with a way of labeling the edges of Wn with the labels 1,1,2,2,3,3,...n, n so that it contains exactly one minimal spanning tree. Make sure that your labeling process is "general:" e. describe how to label Wn for any n, not just W3 or W4. Explain why your processes work. (c) The wheel graph Wn is a graph on n 1 vertices and 2n edges, formed as follows: take a cycle graph Cn, and add a "center" vertex connected to every vertex in Cn. Several examples are drawn at right. Come up with a way of labeling the edges of Wn with the labels 1,1,2,2,3,3,...n, n so that it contains exactly one minimal spanning tree. Make sure that your labeling process is "general:" e. describe how to label Wn for any n, not just W3 or W4. Explain why your processes work