For the graph of Fig. 10.9, which we repeat here as Fig. 10.24:
(a) If the graph is represented as a directed graph, how many arcs are there?
(b) What are the neighborhood profiles for nodes A and B?
(c) What is the diameter of the graph?
(d) How many pairs are in the transitive closure? Hint: Do not forget that there are paths of length greater than zero from a node to itself in this graph.
(e) If we compute the transitive closure by recursive doubling, how many rounds are needed?