Draw a graph that has exactly one maximum clique and exactly one clique that is maximal but not maximum.

Suppose we are applying the pivoting version of the Bron-Kerbosch algorithm to the graph shown below.

- Which vertex would be picked as the pivot in the topmost recursive call to the algorithm?
- What recursive calls to the algorithm would be made directly from this topmost call? List the arguments to each of these recursive calls.

Suppose we are using the same graph shown above as a seed graph for the Barabasi-Albert model. What is the probability that the first edge added by the model connects a new vertex to vertex

*a*?What is the clustering coefficient of the graph shown above?