1. What are the smallest and largest possible numbers of rounds that Boruvka's algorithm can take to compute the minimum spanning tree of an eight-vertex connected graph? (Here a "round" means that each spanning tree in the current forest finds its smallest outgoing edge, and all these edges are added to the forest. As usual, we assume that there are no two edges with equal weights.) Give an example of an eight-vertex graph that uses the smallest possible number of rounds, and another eight-vertex graph that uses the largest possible number of rounds