3. Let C be an undirected graph consisting of six vertices connected into a cycle of six edges (with no other edges in C). Draw or describe an assignment of six different weights to these edges, with the following properties: (a) Boruvka's algorithm, in the first time through its outer loop, adds exactly three of these edges to the forest it is building, and (b) Kruskal's algorithm chooses a different set of three edges as the first three that it adds to the forest it is building