a) Consider two copies of a broadcast graph on n vertices. Add n edges to the new graph on 2n vertices to make it a bg on 2n vertices. Prove your answer. What if you considered two different minimum broadcast graphs on n vertices?

b) Now, you are given two minimum broadcast graphs on n and n+ 1 vertices. Again, add n edges to the new graph on 2n + 1 vertices to make it a broadcast graph on 2n + 1 vertices. Prove your answer. c) Based on the results in parts a) and b) conclude that B(n) [n log n] / 2 for any n > 1.