Distributed Algorithm Problem

Make a table where each row is corresponding to a different topology. The rows should be for: ring, tree, star, clique, hypercube. Each row should have the following additional columns: 1. number of edges given N nodes, 2. advantage of using the particular topology, 3. disadvantage of using the particular topology