Problem 1. (a) Show that Boruvkas algorithm has at most ? 4 iterations if V = 16. (b) Give an example of a graph G with 16 vertices such that Boruvkas algorithm has exactly ? 4 iterations on G.

Problem 2. Let G be the graph shown below (the graph from the class). Find a MST T of G (you may use the MST from the class). Add a new edge (a, i) to G with weight 7. Show that T can be modified to produce a MST of the new graph. 4 a11 6 10 Problem 2. Let G be the graph shown below (the graph from the class). Find a MST T of G (you may use the MST from the class). Add a new edge (a, i) to G with weight 7. Show that T can be modified to produce a MST of the new graph. 4 a11 6 10